Graph state

<p>In <a href="/facts/Quantum_computing/nbbcgmvq">quantum computing</a>, a graph state is a special type of multi-<a href="/facts/Qubit/WveeEubw">qubit</a> state that can be represented by a <a href="/facts/Graph_(discrete_mathematics)/kw3eIBUe">graph</a>. Each qubit is represented by a <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertex</a> 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 <a href="/facts/Entanglement_(graph_measure)/r6huyJe5">entangled</a> states.
</p><p>Graph states are useful in <a href="/facts/Quantum_error-correcting_code/lrUNMuob">quantum error-correcting codes</a>, 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 stabilizer state as well as a 2-uniform hypergraph state, a generalization where the edges have cardinality between 1 and N.
</p>

Graph state open-in-new

Graph state