Graph state

Short description: Concept in quantum computing

In quantum computing, a graph state is a special type of multi-qubit state that can be represented by a graph. Each qubit is represented by a vertex of the graph, and there is an edge between every interacting pair of qubits. In particular, they are a convenient way of representing certain types of entangled states.

Graph states are useful in quantum error-correcting codes, entanglement measurement and purification and for characterization of computational resources in measurement based quantum computing models. A graph state is a particular case of a 2-uniform hypergraph state, a generalization where the edges have N cardinality.

Formal definition

Quantum graph states can be defined in two equivalent ways: through the notion of quantum circuits and stabilizer formalism.

Quantum circuit definition

Given a graph [math]\displaystyle{ G = (V, E) }[/math], with the set of vertices [math]\displaystyle{ V }[/math] and the set of edges [math]\displaystyle{ E }[/math], the corresponding graph state is defined as

[math]\displaystyle{ {\left| G \right\rangle} =\prod _{(a,b)\in E}U^{\{ a,b\} } {\left| + \right\rangle} ^{\otimes V} }[/math]

where [math]\displaystyle{ {\left| + \right\rangle} = \frac{1}{\sqrt{2}}({\left| 0 \right\rangle} +{\left| 1 \right\rangle} ) }[/math] and the operator [math]\displaystyle{ U^{\{ a,b\} } }[/math] is the controlled-Z interaction between the two vertices (corresponding to two qubits) [math]\displaystyle{ a }[/math] and [math]\displaystyle{ b }[/math]

[math]\displaystyle{ U^{\{ a,b\} } =\left[\begin{array}{cccc} {1} & {0} & {0} & {0} \\ {0} & {1} & {0} & {0} \\ {0} & {0} & {1} & {0} \\ {0} & {0} & {0} & {-1} \end{array}\right] }[/math]

Stabilizer formalism definition

An alternative and equivalent definition is the following, which makes use of the stabilizer formalism.

Define an operator [math]\displaystyle{ S_v }[/math] for each vertex [math]\displaystyle{ v }[/math] of [math]\displaystyle{ G }[/math]:

[math]\displaystyle{ S_v =\sigma _{x}^{(v)} \prod _{u \in N(v)} \sigma _{z}^{(u)} }[/math]

where [math]\displaystyle{ \sigma _{x,y,z} }[/math] are the Pauli matrices and [math]\displaystyle{ N(v) }[/math] is the set of vertices adjacent to [math]\displaystyle{ v }[/math]. The [math]\displaystyle{ S_v }[/math] operators commute. The graph state [math]\displaystyle{ {\left| G \right\rangle} }[/math] is defined as the simultaneous [math]\displaystyle{ +1 }[/math]-eigenvalue eigenstate of the [math]\displaystyle{ \left|V\right| }[/math] operators [math]\displaystyle{ \left\{S_v \right\}_{v \in V} }[/math]:

[math]\displaystyle{ S_v {\left| G \right\rangle} = {\left| G \right\rangle} }[/math]

Equivalence between the two definitions

A proof of the equivalence of the two definitions can be found in.

Examples

• If [math]\displaystyle{ G = P_3 }[/math] is a three-vertex path, then the [math]\displaystyle{ S_v }[/math] stabilizers are

[math]\displaystyle{ \begin{align} \sigma_x \otimes {}&\sigma_z \otimes I, \\ \sigma_z \otimes {}&\sigma_x \otimes \sigma_z, \\ I \otimes {}&\sigma_z \otimes \sigma_x \end{align} }[/math]

The corresponding quantum state is

[math]\displaystyle{ {\left| P_3 \right\rangle} = \frac{1}{\sqrt{8}}( {\left| 000 \right\rangle} + {\left| 100 \right\rangle} + {\left| 010 \right\rangle} - {\left| 110 \right\rangle} + {\left| 001 \right\rangle} + {\left| 101 \right\rangle} - {\left| 011 \right\rangle} + {\left| 111 \right\rangle} ) }[/math]

• If [math]\displaystyle{ G = K_3 }[/math] is a triangle on three vertices, then the [math]\displaystyle{ S_v }[/math] stabilizers are

[math]\displaystyle{ \begin{align} \sigma_x \otimes {}&\sigma_z \otimes \sigma_z, \\ \sigma_z \otimes {}&\sigma_x \otimes \sigma_z, \\ \sigma_z \otimes {}&\sigma_z \otimes \sigma_x \end{align} }[/math]

The corresponding quantum state is

[math]\displaystyle{ {\left| K_3 \right\rangle} = \frac{1}{\sqrt{8}}( {\left| 000 \right\rangle} + {\left| 100 \right\rangle} + {\left| 010 \right\rangle} - {\left| 110 \right\rangle} + {\left| 001 \right\rangle} - {\left| 101 \right\rangle} - {\left| 011 \right\rangle} - {\left| 111 \right\rangle} ) }[/math]

Observe that [math]\displaystyle{ {\left| P_3 \right\rangle} }[/math] and [math]\displaystyle{ {\left| K_3 \right\rangle} }[/math] are locally equivalent to each other, i.e., can be mapped to each other by applying one-qubit unitary transformations. Indeed, switching [math]\displaystyle{ \sigma_x }[/math] and [math]\displaystyle{ \sigma_y }[/math] on the first and last qubits, while switching [math]\displaystyle{ \sigma_y }[/math] and [math]\displaystyle{ \sigma_z }[/math] on the middle qubit, maps the stabilizer group of one into that of the other.

More generally, two graph states are locally equivalent if and only if the corresponding graphs are related by a sequence of so-called "local complementation" steps, as shown by Van den Nest et al. (2005).

See also

• Entanglement
• Cluster state

References

• M. Hein; J. Eisert; H. J. Briegel (2004). "Multiparty entanglement in graph states". Physical Review A 69 (6): 062311. doi:10.1103/PhysRevA.69.062311. Bibcode: 2004PhRvA..69f2311H. 
• S. Anders; H. J. Briegel (2006). "Fast simulation of stabilizer circuits using a graph-state representation". Physical Review A 73 (2): 022334. doi:10.1103/PhysRevA.73.022334. Bibcode: 2006PhRvA..73b2334A. 
• M. Van den Nest; J. Dehaene; B. De Moor (2005). "Local unitary versus local Clifford equivalence of stabilizer states". Physical Review A 71 (6): 062323. doi:10.1103/PhysRevA.71.062323. Bibcode: 2005PhRvA..71f2323V. 

External links

• Quantum graph states: two equivalent definitions