# 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.

8 questions
Filter by
Sorted by
Tagged with
35 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 ...
40 views

### Dephasing in graph states

In a recent paper Graph States as a Resource for Quantum Metrology. In the Appendix it states: We model an $n$ qubit graph state $G$ undergoing iid dephasing via G \to G^{\text{dephasing}} = \...
177 views

### Query on paper on entanglement in graph states

Quick question on the paper Entanglement in Graph States. On page 14. a definition of a graph state: Given $|+\rangle=\frac{1}{\sqrt{2}}(|0\rangle + |1\rangle)$. Let $G=(V,E)$ be a graph. The ...
40 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,...
186 views

### Graph state and maximally entangled state

How can I show that a multi-qudit graph state $|G\rangle$ is the maximally entangled state? What kind of measure of entanglement can be used to quantify the amount of entanglement in a given graph ...
66 views

### The classical simulation of 2D graph state and the measurement based quantum computation

In my former post on Physics SE I deduced a contradiction in the classical simulation of 2D graph state and the classical simulation of general measurement-based quantum computation. In Norbert's ...
Given an arbitrary graph state $|G\rangle$ represented by the graph $G$, can one use the graphical structure to calculate the number of ebits (entanglement bits) present in the state? If so, how?