The DOI matches its OpenAlex record; 12 of the 12 references it cites were found in a registry or an index.
Entanglement in graph states and its applications
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Proposed Experiment to Test Local Hidden-Variable Theories
Clauser, J. F., Horne, M. A., Shimony, A., & Holt, R. A. (1969) · Physical Review Letters · doi:10.1103/physrevlett.23.880 · Cited by 7,573
(2010) · Introduction to Combinatorics · doi:10.1201/b12336-12 · Cited by 5,632
Diestel, R. (1997) · Cited by 5,082
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655
Self-citationStabilizer Codes and Quantum Error Correction
Gottesman, D. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9705052 · Cited by 753
The Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9807006 · Cited by 489
Quantum Computation and Information
(2002) · Contemporary Mathematics · doi:10.1090/conm/305 · Cited by 399
Diverging Entanglement Length in Gapped Quantum Spin Systems
Verstraete, F., Martín-Delgado, M. A., & Cirac, J. I. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.087201 · Cited by 364
Fault-tolerant quantum computation with cluster states
Nielsen, M. A., & Dawson, C. M. (2005) · Physical Review A · doi:10.1103/physreva.71.042323 · Cited by 161
Multipartite Entanglement Detection in Bosons
Alves, C., & Jaksch, D. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.110501 · Cited by 102
Cited by
Colloquium : Area laws for the entanglement entropy
Eisert, J., Cramer, M., & Plenio, M. B. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.277 · Cited by 2,873
Self-citationMultiphoton entanglement and interferometry
Pan, J.-W., Chen, Z.-B., Lu, C.-Y., Weinfurter, H., Zeilinger, A., & Żukowski, M. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.777 · Cited by 1,410
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090
Self-citationK S, U. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.18067974 · Cited by 733
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Metadata
- Authors
- Hein, M., Dür, W., Eisert, J., Raussendorf, R., den Nest, M. V., & Briegel, H. J.
- Venue
- arXiv (Cornell University)
- Publisher
- Cornell University
- Published
- 2006-02-11
- Pages
- 115-218
- ISSN
- 2331-8422 (ISSN-L)
- OpenAlex
- W1522547328
- Cited by
- 284
- References
- 12
- Type
- posted content
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Entanglement in graph states and its applications. https://app.cochat.ai/papers/10.3254/978-1-61499-018-5-115
- The paper
- Hein, M., Dür, W., Eisert, J., Raussendorf, R., den Nest, M. V., & Briegel, H. J. (2006). Entanglement in graph states and its applications. arXiv (Cornell University). https://doi.org/10.3254/978-1-61499-018-5-115
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.