Student or educator? Sign up with your school email and get 6 months of Pro free.
PreprintCited by 284

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 access
M. Hein, Wolfgang Dür, Jens Eisert, Robert Raussendorf, M. Van den Nest, H. J. Briegel·2006·arXiv (Cornell University)

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.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

OpenAlex · 10.3254/978-1-61499-018-5-115

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 12 references

Cited by

See all 284

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.