Entanglement in eight-qubit graph states
From MaRDI portal
Publication:662917
DOI10.1016/J.PHYSLETA.2009.04.055zbMATH Open1231.81012arXiv0812.4625OpenAlexW2163749726WikidataQ62115725 ScholiaQ62115725MaRDI QIDQ662917FDOQ662917
Authors: Adán Cabello, Antonio J. López-Tarrida, Pilar Moreno, J. R. Portillo 
Publication date: 13 February 2012
Published in: Physics Letters. A (Search for Journal in Brave)
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)].
Full work available at URL: https://arxiv.org/abs/0812.4625
Recommendations
Cites Work
- Quantum cryptography based on Bell’s theorem
- Nonlocality of cluster states of qubits
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Graph states for quantum secret sharing
- Multiparty entanglement in graph states
- Two-colorable graph states with maximal Schmidt measure
- Local unitary versus local Clifford equivalence of stabilizer states
- Scheme for Demonstration of Fractional Statistics of Anyons in an Exactly Solvable Model
- Stabilizer codes can be realized as graph codes
- Hyper-entangled states
Cited In (17)
- Multiparty entanglement in graph states
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- Two-colorable graph states with maximal Schmidt measure
- Graph states and the variety of principal minors
- Clifford 3-qubit states
- Efficient entanglement measure for graph states
- Investigation of preparation up to six and \(N\)-atom graph states
- Three-qubit entangled embeddings of \(CPT\) and Dirac groups within \(E_8\) Weyl group
- Graph states and local unitary transformations beyond local Clifford operations
- Quantum computing with octonions
- Resources Required for Preparing Graph States
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- Generation of multi-qubit graph states via spin networks
- Exclusivity structures and graph representatives of local complementation orbits
- Four-qubit states generated by Clifford gates
- Direct evaluation of pure graph state entanglement
- Geometric properties of evolutionary graph states and their detection on a quantum computer
Uses Software
This page was built for publication: Entanglement in eight-qubit graph states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q662917)
