Entanglement in Graph States and its Applications
read the original abstract
Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. At the same time, they can be described by a number of parameters that grows only moderately with the system size. They have a variety of applications in quantum information theory, most prominently as algorithmic resources in the context of the one-way quantum computer, but also in other fields such as quantum error correction and multi-partite quantum communication, as well as in the study of foundational issues such as non-locality and decoherence. In this review, we give a tutorial introduction into the theory of graph states. We introduce various equivalent ways how to define graph states, and discuss the basic notions and properties of these states. The focus of this review is on their entanglement properties. These include aspects of non-locality, bi-partite and multi-partite entanglement and its classification in terms of the Schmidt measure, the distillability properties of mixed entangled states close to a pure graph state, as well as the robustness of their entanglement under decoherence. We review some of the known applications of graph states, as well as proposals for their experimental implementation.
This paper has not been read by Pith yet.
Forward citations
Cited by 17 Pith papers
-
Sector length distributions of recursively definable graph states through analytic combinatorics
Closed-form sector length distributions for recursively definable graph states (paths, cycles, stars, grids) via generating functions, yielding analytical concentratable entanglement, depolarizing fidelity bounds, and...
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
-
Stabilizer R\'enyi entropy of 3-uniform hypergraph states
Stabilizer Rényi entropy of 3-uniform hypergraph states equals a matrix-rank expression, cutting computation from exponential in 3N to polynomial in N times exponential in N.
-
Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation
Graph completeness encodes full exchange symmetry while directed orientation on complete graphs encodes full antisymmetry in multipartite quantum states.
-
Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence
Bra-ket entanglement indicates a shift from coherence-dominated to magic-dominated entanglement generation as its value increases.
-
A graph-aware bounded distance decoder for all stabilizer codes
A graph-based bounded distance decoder corrects all errors up to a chosen weight in arbitrary stabilizer codes by representing stabilizers and syndromes as graphs and pruning the search space with a feed-forward structure.
-
Suppressing the Erasure Error of Fusion Operation in Photonic Quantum Computing
Tree-encoded fusion with spin qubit memory suppresses erasure errors in photonic graph-state generation, yielding exponential compiler gains over OneAdapt on benchmarks and hardware validation.
-
Localized Entanglement Purification
Localized Entanglement Purification (LEP) is a new family of protocols that purifies entanglement at the level of network regions by exploiting spatial noise asymmetries to reduce resource consumption for larger quant...
-
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.
-
Entanglement witnesses for stabilizer states and subspaces beyond qubits
Generalizes entanglement witnesses from qubit stabilizer states to multi-qudit versions, showing better noise robustness in some cases.
-
Graph-State Circuit Blocks control Entanglement and Scrambling Velocities
LC-inequivalent graph-state blocks in random Clifford circuits yield distinct entanglement velocities v_E and butterfly velocities v_B, correlated with internal entanglement distribution and graph connectivity.
-
Scalable and deterministic Greenberger-Horne-Zeilinger state generation via graph states-assisted measurements
A protocol is presented that grows large entangled multi-qubit states, including generalized GHZ states, from smaller entangled pairs via graph-basis-assisted measurements that truncate Hilbert space and concentrate e...
-
Logarithmic growth of peripheral entanglement concentrated via noisy measurements in a star network of spins
In a star network of qubits with XYZ Heisenberg interactions, localizable bipartite peripheral entanglement grows logarithmically with periphery size at zero xy-anisotropy and survives noisy measurements in the large-...
-
Controlling gain with loss: Bounds on localizable entanglement in multi-qubit systems
Derives bounds on localizable entanglement versus lost entanglement for GHZ/W states, shows asymptotic equality for large Dicke states, and cubic scaling in XY/XXZ models, including under phase-flip noise.
-
A hybrid variational quantum circuit approach for stabilizer states classifiers
Variational quantum circuits learn entanglement orbits under local unitary actions to classify four-qubit stabilizer states.
-
Architecture and protocols for all-photonic quantum repeaters
New building block and protocol for all-photonic quantum repeaters using repeater graph states that reduces emissive memories at end nodes and integrates with memory-based systems.
-
Entanglement Certification $-$ From Theory to Experiment
Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.