Graph state

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.

Formal definition

Given a graph G = (V, E), with the set of vertices V and the set of edges E, the corresponding graph state is defined as

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

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

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]

Alternative definition

An alternative and equivalent definition is the following.

Define an operator $S_{v}$ for each vertex v of G:

S_{v}=\sigma _{x}^{(v)}\prod _{u\in N(v)}\sigma _{z}^{(u)}

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

S_{v}{\left|G\right\rangle }={\left|G\right\rangle }

Examples

If $G=P_{3}$ is a three-vertex path, then the $S_{v}$ stabilizers are

{\begin{aligned}\sigma _{x}\otimes \sigma _{z}\otimes I,\\\sigma _{z}\otimes \sigma _{x}\otimes \sigma _{z},\\I\otimes \sigma _{z}\otimes \sigma _{x}\end{aligned}}

The corresponding quantum state is

{\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 })

If $G=K_{3}$ is a triangle on three vertices, then the $S_{v}$ stabilizers are

{\begin{aligned}\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{aligned}}

The corresponding quantum state is

{\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 })

Observe that ${\left|P_{3}\right\rangle }$ and ${\left|K_{3}\right\rangle }$ are locally equivalent to each other, i.e., can be mapped to each other by applying one-qubit unitaries. Indeed, switching $\sigma _{x}$ and $\sigma_y$ on the first and last qubits, while switching $\sigma_y$ and $\sigma _{z}$ 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).

References

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

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

Graph state

Formal definition

Alternative definition

Examples

See also

References