Determining X-chains in graph states
arXiv:1507.06082 · doi:10.1088/1751-8113/49/5/055302
Abstract
The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-Chains [Phys. Rev. A 92(1) 012322]. We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states.
arXiv commentPublished version with corrections of some typos and refferences
References in corpus (10)
- Measurement-based quantum computation with cluster states
- Graph States for Quantum Secret Sharing
- Quantum error-correcting codes associated with graphs
- Entanglement Detection in the Stabilizer Formalism
- Repeat-Until-Success Quantum Computing
- Experimental demonstration of graph-state quantum secret sharing
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Experimental demonstration of a graph state quantum error-correction code
- Randomized Graph States and their Entanglement Properties
- Group structures and representations of graph states