REVIEW 10 cited by
Multi-party entanglement in graph states
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 are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multi-party quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multi-particle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimension, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphies.
Forward citations
Cited by 10 Pith papers
-
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.
-
A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity
Rank integrity is XP in the rank parameter k yet W[1]-hard, and is equivalent up to a factor of two to ancilla integrity of graph states for clustering entanglement.
-
Expressibility of neural quantum states: a Walsh-complexity perspective
Walsh complexity reveals that shallow additive neural quantum states require logarithmic depth to represent certain short-range entangled dimerized states with maximal parity spread.
-
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.
-
Constraints on four-party entanglement in holography
In time-reflection-symmetric holographic states, I3 is necessary for non-vanishing four-party entanglement signals, bounds multi-entropy measures, and implies vanishing of Q4.
-
Adaptive Framework for Failure-Aware Protocols in Fusion-Based Graph-State Generation
Adaptive reuse of partially built graph states after failed fusion measurements, combined with graph-theoretic ordering, can cut expected fusion overhead by orders of magnitude relative to repeat-until-success.
-
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.
-
Entanglement in Directed Graph States
For graph states made of identical controlled-phase gates on |+> qubits, the Entanglement Distance per qubit equals 1 minus the average of cos(θ) to the power twice the vertex degree.
-
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.