Questions tagged [graph-states]

Graph-states are a class of quantum state that can be efficiently and uniquely represented by graphs. In the case of qubit graph states, each edge corresponds to a CZ operation applied between two qubits in the +1 X eigenstate. Graph states have a number of useful properties that make them useful objects for the analysis of large quantum systems and play a prominent role in the analysis of quantum computation and communication architectures and protocols.

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6
votes
0answers
64 views

Query on Reduced Graph States

Reduced graph states are characterized as follows (from page 46 of this paper): Let $A \subseteq V$ be a subset of vertices for a graph $G = (V,E)$ and $B = V\setminus A$ the corresponding complement ...
2
votes
1answer
40 views

$X$ measurement on graph state leads to edge contraction

I cannot understand the proof of Lemma 5 from the paper "Resources Required for Preparing Graph States". Here it is: (In this paper, $|G:S\rangle$ denotes $Z_S$ applied to the graph state $|G\rangle$,...
2
votes
0answers
39 views

Graph coloring to reduce the number of qubits in VQE

I am reading through the following article: https://arxiv.org/abs/1312.2579 and I really struggle to understand anything of the section "D. The standard graph-coloring method" on page 7 and "E. The ...
2
votes
0answers
43 views

What does it mean to have 2000 qubits and 6016 couplers?

From official D-Wave docs: The D-Wave 2000Q QPU has up to 2048 qubits and 6016 couplers. For example, I have the optimization problem defined as the QUBO problem. If I want to solve it on D-Wave,...
1
vote
1answer
36 views

Quantum Error Correcting Codes and Graphs

Couple of weeks ago I asked this question on theory CS but I didn't get an answer. So trying it here. I was reading combinatorial approach towards quantum correction. A lot of work in this is on ...