Entanglement in eight-qubit graph states
arXiv:0812.4625 · doi:10.1016/j.physleta.2009.04.055
Abstract
Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford group. For each of these classes we obtain a representative which requires the minimum number of controlled-Z gates for its preparation, and calculate the Schmidt measure for the 8-partite split, and the Schmidt ranks for all bipartite splits. This results into an extension to 8 qubits of the classification of graph states proposed by Hein, Eisert, and Briegel [Phys. Rev. A 69, 062311 (2004)].
REVTeX4, 9 pages, 2 figures
References in corpus (14)
- Multi-party entanglement in graph states
- Experimental entanglement of six photons in graph states
- Graph States for Quantum Secret Sharing
- Experimental Analysis of a 4-Qubit Cluster State
- Universal resources for measurement-based quantum computation
- Bell Inequalities for Graph States
- Realization and characterization of a 2-photon 4-qubit linear cluster state
- Demonstrating anyonic fractional statistics with a six-qubit quantum simulator
- A scheme for demonstration of fractional statistics of anyons in an exactly solvable model
- Experimental demonstration of a quantum protocol for Byzantine agreement and liar detection
- Enhancing the Violation of the Einstein-Podolsky-Rosen Local Realism by Quantum Hyper-entanglement
- Mermin inequalities for perfect correlations
- Generalized Ardehali-Bell inequalities for graph states
- Bipartite all-versus-nothing proofs of Bell's theorem with single-qubit measurements
Cited by in corpus (27)
- Entanglement detection
- Quantum circuits for maximally entangled states
- Optimal preparation of graph states
- Generation of arbitrary all-photonic graph states from quantum emitters
- Mapping graph state orbits under local complementation
- Graph states and local unitary transformations beyond local Clifford operations
- Direct evaluation of pure graph state entanglement
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
- Efficient Entanglement Measure for Graph States
- Compact set of invariants characterizing graph states of up to eight qubits
- On the local equivalence of complete bipartite and repeater graph states
- Graph states in phase space
- Geometric properties of evolutionary graph states and their detection on a quantum computer
- Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
- All-versus-nothing proofs with n qubits distributed between m parties
- Exclusivity structures and graph representatives of local complementation orbits
- Graphical Framework for Non-Gaussian Quantum States
- Many-body quantum resources of graph states
- Generating graph states with a single quantum emitter and the minimum number of fusions
- Vector Generation of Contextual Sets
- Tensor Rank and Other Multipartite Entanglement Measures of Graph States
- Small quantum networks in the qudit stabilizer formalism
- Distinguishing Graph States by the Properties of Their Marginals
- Maximal Entanglement: Applications in Quantum Information and Particle Physics
- Graph States and the Variety of Principal Minors
- Studies of properties of bipartite graphs with quantum programming