DeterminingX-chains in graph states
From MaRDI portal
Publication:2994648
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.
Recommendations
- A graph theoretical approach to states and unitary operations
- From graph states to two-graph states
- Graph states in phase space
- Graph states and the necessity of Euler decomposition
- Stateless quantum structures and extremal graph theory
- Quantum states associated to mixed graphs and their algebraic characterization
- On the ground state for quantum graphs
- Quantum discord of states arising from graphs
- Generalized graph states based on Hadamard matrices
- Spin chains, graphs and state revival
Cited in
(2)
This page was built for publication: DeterminingX-chains in graph states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994648)