REVIEW 33 cited by
Entanglement in Graph States and its Applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 33 Pith papers
-
LightStim: A Framework for QEC Protocol Evaluation and Prototyping with Automated DEM Construction
LightStim automates DEM construction for QEC protocols via an augmented Pauli tableau during compilation, matching public tools on detector counts and error rates while enabling new cross-code designs.
-
Local Equivalences of Graph States
Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.
-
Quantum machine learning models for graphs
Characterizes constituents of n-qubit graph quantum ML models and supplies a toolbox enabling integration with classical models, generalization of prior GQML approaches, and classical pre-training.
-
A no-go theorem for privacy in distributed sensing using Gaussian states
No distributed sensing protocol using Gaussian states can achieve perfect privacy.
-
A five-qubit 1-resistant graph state and stabilizer marginal certificates
The five-cycle graph state |C5> is the unique (up to local Clifford) 1-resistant five-qubit stabilizer state; no seven-qubit stabilizer state is m-resistant for nonzero admissible m.
-
Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant
Graph-state inner products are governed by the F2-rank of the adjacency matrix and the Arf invariant, yielding a nonlocal Bell-pair factorization of the Hilbert space.
-
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.
-
Majority-Agreed Key Distribution using Absolutely Maximally Entangled Stabilizer States
For shared stabilizer and graph states, secret key distribution between two parties is possible exactly when they are inseparable, and for AME stabilizer states the help of any majority of parties is necessary and sufficient.
-
Quantum Routers: A Switching-Fabric Framework for Quantum-Native Forwarding
The paper introduces an entanglement-based switching fabric for quantum routers using graph states and local measurements to achieve non-blocking operation with constant forwarding depth.
-
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.
-
Block entanglement bounds distribution of regionally localized entanglement
For permutation-symmetric and certain magnetization-sector pure states, the total regionally localized entanglement around a hub is bounded by the block localized entanglement and block entanglement.
-
Efficient construction of fault-tolerant neutral-atom cluster states
A cavity-based protocol using counterfactual carving and a heralded gate can construct a fault-tolerant 3D cluster state with errors an order of magnitude below threshold at cooperativity 160 and 15-atom resource states.
-
Calibrated hypergraph states: II calibrated hypergraph state construction and applications
Calibrated hypergraph states over Galois rings generalize weighted hypergraph states, are stabilizer and locally maximally entangleable, and reduce to the weighted class in the qubit case only.
-
Calibrated hypergraph states: I calibrated hypergraph and multi qudit state monads
Calibrated hypergraphs and multi-qudit states are shown to form graded Ω monads, providing a categorical foundation for a broad generalization of hypergraph states.
-
Graph States as a Resource for Quantum Metrology
Bundled graph states achieve near-Heisenberg-limited phase estimation and retain a quantum advantage under iid dephasing and, on average, under a few qubit erasures.
-
Emergence of a Macroscopic Cat State and Multi-Channel Entanglement in a Frustrated Cluster Spin Chain
A cluster–ANNNI spin chain has a first-order QPT between a ferromagnetic cat-state phase (gap closing exponentially) and a gapped incommensurate phase with four dominant Schmidt channels.
-
Resource Management in Heterogeneous Quantum Repeater Networks
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
-
Failure Tolerant Phase-Only Indoor Positioning via Deep Learning
A deep-learning phase-only positioning method, anchored on hyperbola intersection, is reported to stay accurate under antenna failures and to outperform earlier phase-only approaches.
-
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.
-
Thermal state entanglement entropy on a quantum graph
The authors conjecture that the spin entanglement entropy of a thermalized quantum walk on a graph equals the logarithm of the total node length of the graph's minimum cycle basis, and report numerical agreement on Wa...
-
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.
-
Entanglement in Quantum Systems Based on Directed Graphs
For a class of graph states with commuting controlled-rotation gates, the Fubini-Study entanglement distance depends only on the vertex degree sequence, and this paper works out explicit formulas for four example grap...
-
Entanglement Classification in the Graph States: The generalization to $n$-Qubits States using the Entanglement Matrix
The paper defines an Entanglement Matrix and claims maximum entanglement of n-qubit graph states is N^2-N for odd N, with piecewise quadratic formulas for even N and a special enhancement for multiples of 12.
-
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.
-
Many-Body Entanglement in Solid-State Emitters
A wide-ranging survey of how solid-state quantum emitters coupled to nanophotonics are being pushed toward many-body entangled states, and of the coherence and inhomogeneity barriers that stand in the way.
-
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). Continue with ORCID to comment.