Pith. Sign in

REVIEW

Entanglement in Graph States and its Applications

PaperPDF from arXiv

data files

ReviewThe objections and verdict, as JSON Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, H.-J. Briegel

Quantum Physics · Submitted 11 Feb 2006 · 176 references

Pith's verdict: A solid, well-organized 2006 review of graph states that still earns its place as a reference; the soft spots are small and mostly typographical.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on October 29, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 1 major objection · 10 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0602096 (version 1)
Pith IDVH5BSMA5, Pith's permanent record of this paper and its review
CitationH.-J. Briegel, J. Eisert, M. Hein, M. Van den Nest, R. Raussendorf, W. D\"ur. "Entanglement in Graph States and its Applications." arXiv:quant-ph/0602096 (2006). https://pith.science/paper/VH5BSMA5
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report

How Pith checks papers → · Full audit of this paper →

The paper

The paper claims

Graph states make multipartite entanglement tractable by encoding it in a graph.

The reading

This review argues that graph states are a rare middle ground in quantum information: they carry genuine multipartite entanglement and support central protocols, yet their preparation, stabilizer description, local equivalence, and many entanglement properties can be expressed through a graph whose adjacency matrix grows only quadratically in the number of qubits. The authors define graph states both as the result of Ising-type two-qubit interactions and as the unique common eigenstates of correlation operators $K_a=�sigma_x^a�prod_{b�in N_a}�sigma_z^b$, then use the graph to organize local Clifford equivalence, reduced states, Schmidt-rank and Schmidt-measure bounds, and applications. The payoff is a standard form for stabilizer states and a practical language for measurement-based quantum computing, graph codes, multiparty communication, and decoherence studies. A reader should care because the review turns questions about many-party entanglement into finite graph problems that can often be answered efficiently.

What carries the argument

The load-bearing object is the graph state $|G�rangle$, prepared from $|+�rangle^{V}$ by applying a controlled phase gate $U_{ab}$ on every edge $�{a,b�}�in E$, equivalently the unique $+1$ eigenstate of $K_a=�sigma_x^a�prod_{b�in N_a}�sigma_z^b$. Its adjacency matrix is the graph's complete invariant, and the review's main technical engine is the translation of state operations into graph operations: local complementation $�tau_a$ implements local Clifford equivalence, Pauli measurements delete vertices and complement neighborhoods, and bipartite entanglement is read from the $�mathbb{F}_2$-rank of the cut matrix. This is what lets the review move between stabilizer algebra, entanglement measures, and applications without leaving the graph language.

Extended reading notes

Core claim

The central claim is that graph states are simultaneously rich enough to exhibit the essential features of multipartite entanglement and restricted enough to remain describable by a graph. In the review's account, the adjacency matrix $�Gamma$ fixes the stabilizer generators $K_a$, local complementation at a vertex generates the local-Clifford orbit, the Schmidt rank across a cut $(A,B)$ equals the rank over $�mathbb{F}_2$ of the off-diagonal block $�Gamma_{AB}$, and the Schmidt measure is bounded below by the maximal Schmidt rank and above by the Pauli persistency or the size of a vertex cover. The review uses these identities to classify graph states up to local Clifford operations for up to seven vertices and to discuss nonlocality, localizable entanglement, purification, and robustness under decoherence. It also presents graph states as resources: cluster states for the one-way quantum computer, graph codes for error correction, two-colorable graph states for secret sharing and purification, and weighted graph states for disordered many-body systems.

Load-bearing premise

The review's classification and equivalence claims rely on local Clifford equivalence standing in for local unitary equivalence of graph states, an implication the text itself leaves open in general.

Editorial extensions

If this is right

  • Every stabilizer state can be brought to a graph state by local Clifford operations, so graph states serve as standard forms for stabilizer codes and their error-correcting properties.
  • Entanglement across any cut is computable from the cut's adjacency block, giving an efficient rank test for Schmidt rank and bounds on the Schmidt measure.
  • The one-way quantum computer can be described as a sequence of local Pauli measurements on a cluster state, with the graph updated by vertex deletion and local complementation.
  • Two-colorable graph states support CSS codes, secret-sharing protocols, and multipartite purification, while some graph topologies retain distillable entanglement independently of system size under decoherence.
  • Graph states can be prepared wherever a uniform Ising interaction is available, including optical lattices and hybrid light-matter architectures.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The classification program can be pushed beyond seven vertices by using graph isomorphism and local complementation as the search space; the review's tables are a seed for a computational census of multipartite entanglement classes.
  • Because Schmidt measure is bounded by vertex cover and Pauli persistency, graph states with small covers are natural candidates for classical simulation schemes based on limited Schmidt rank.
  • The size-independent entanglement lifetime found for some graph states suggests a design principle: choose graph topology, not just initial state, to protect multipartite entanglement against decoherence.
  • Weighted graph states connect the review's discrete stabilizer picture to disordered spin systems and variational ans�tze, a bridge the review notes but does not fully develop.
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.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,248 input tokens.

What the abstract itself states, as probabilities: claims first 0.02 · states limitation 0.10 · human participants 0.02 · controlled comparison 0.01 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.04 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Graph states form a rich class of entangled states that exhibit important aspects of multi-partite entanglement. background 1.00 0.07 0.09 asserted 1.00
s1 At the same time, they can be described by a number of parameters that grows only moderately with the system size. background 1.00 0.11 0.05 asserted 0.97
s2 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. background 1.00 0.04 0.08 asserted 1.00
s3 In this review, we give a tutorial introduction into the theory of graph states. contribution 0.99 0.72 0.04 asserted 0.89
s4 We introduce various equivalent ways how to define graph states, and discuss the basic notions and properties of these states. contribution 0.94 0.81 0.04 asserted 0.94
s5 The focus of this review is on their entanglement properties. contribution 0.94 0.33 0.10 asserted 0.99
s6 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. contribution 0.96 0.21 0.10 asserted 0.93
s7 We review some of the known applications of graph states, as well as proposals for their experimental implementation. contribution 0.97 0.16 0.07 asserted 0.92

What kind of paper the classifier reports this is: review 1.00 · evidence from literature 0.99.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. – This ring depicts a graph with 7 vertices 1 . 2. Notations. – At the basis this review article lies the concept of a graph [26, 27]. A graph is a collection of vertices and a de￾scription which of the vertices are connected by an edge. Each graph can be represented by a diagram in a plane, where a vertex is repre￾sented by a point and the edges by arcs joining two not necessarily distinct vertices. In this pictorial representation many concepts re￾lated to graphs can be visualized in a transparent manner. In the con￾text of the present article, vertices play the role of physical…
Figure 2. – The preparation procedure to ob￾tain a graph state that corresponds to a ring graph with 5 vertices. Graph states (I) Let G = (V, E) be a graph. The graph state |Gi that corresponds to the graph G is the pure state with state vector (24) |Gi = Y {a,b}∈E Uab |+i V . We will also refer to the state vector|Gi of the pure state as a graph state. The preparation procedure reads: 1. Prepare the qubits at each vertex in the pure state with state vector |+i as eigenvector of σx with eigenvalue +1. 2. Apply the phase gate Uab to all vertices a, b that are adjacent in G. Since Uab is the…
Figure 3. – The correlation operators for a graph state that corresponds to a ring with 5 vertices 2 . 2. Stabilizer formalism. – It is often more con￾venient to work with the stabilizer of a quantum state (or subspace) than with the state (or subspace) itself. Quantum information theory uses the sta￾bilizer formalism in a wide range of applications. Among those, quantum error correcting codes (sta￾bilizer codes) are a very prominent example [22]. Here, the stabilizer( 8 ) S is a commutative sub￾group of the Pauli group P V that does not con￾tain −1V (and thus not ±i1V ). Apart from the in￾
Figure 4. – An example for a successive applica￾tion of the LC-rule, which exhibits the whole equivalence class associated with graph No. 1. The rule is successively applied to the vertex, which is colored red in the figure
Figure 5. – The generator matrix for a graph state
Figure 6. – A graph state for a ring with 5 vertices as valence bond solid. In the remainder of this section we focus on another description of graph states in terms of Valence Bond Solids (VBS), which does not rely on the stabilizer for￾malism and, hence, can be extended to weighted graph states (see sec. 9). This representation was recently in￾troduced by Verstraete and Cirac [71] and has already found interesting applications in density-matrix renor￾malization group (DMRG)( 15) methods. The VBS pic￾ture has its roots in the Affleck-Kennedy-Lieb-Tasaki (AKLT) model [73], which allows to find
Figure 7. – The phase gate on the level of the virtual
Figure 8. – Example for a σx-measurement at vertex 1 in graph No. 1, which is followed by a σz-measurement at vertex 2: In graph No. 1 a σx-measurement is per￾formed at the vertex 1. For the application of the x￾measurement rule, vertex 2 was chosen as the spe￾cial neighbor b0, yielding the graph No. 2 up to a lo￾cal unitary U (1) x,± = (±iσ(2) y ) 1/2 . As stated in Table II, the subsequent σz-measurement on the new graph state is therefore essentially another σx-measurement, now at vertex 2 with a single neighbor b0 = 5. The final graph is then graph No. 3. Although this result was alread
Figure 9. – The GHZ-state is LU-equivalent to the graph state corresponding to a star graph or the complete graph. 4 . 1. GHZ–states. – We start by considering the N–qubit Greenberger-Horne-Zeilinger states (106) |GHZi = 1 √ 2 (|0i ⊗N + |1i ⊗N ), which were introduced in ref. [79] for the case of three qubits and since serve as a ‘text book’ ex￾ample for multi-party entangled ‘Schr¨odinger cat’ states. These states are special examples of states that maximally violate multi-partite Bell inequalities [80] and can, for instance, be used to im￾prove frequency standards [81]. GHZ states ha
Figure 10. – –Quantum Fourier Transformation on 3 qubits– The upper left graph is a 13 × 5-cluster state and represents the initial resource for implementing a QFT on three qubits in the framework of the one-way quantum computer. After removing some superfluous vertices by means of σz-measurements the right up￾per graph is obtained, whereas the lower graph is achieved after performing all Pauli measurements within the local measurement protocol associated with the QFT, except the measurements on the input and output vertices and corresponds to the ‘non-classical’ resource for the QFT. The…
Figure 11. – –Five-Qubit-Code and concatenated CSS-Code– The graphs representing the encoding procedure for the five-qubit and the concatenated [7, 1, 3]-CSS-code with in￾put (red), auxiliary (blue) and output (black) vertices. The encoding consists in preparing the qubit at the (red) input vertex in the input state and the remaining qubits in the |+i state, entangling the qubits according to the graph and finally measuring the (blue) auxiliary vertices( 27) and the input ver￾tex in the σx-direction. In this way the input state is encoded into the state on the remaining (black) qubits. Alterna
Figure 12. – The encoding graph for the Steane code is two-colorable. In [47] CSS states are used to design a ‘prepare and measure’ protocol for quantum cryptography that can be used for conference key agreement( 29) and quantum sharing of classical secrets( 30). We remark that not all Pauli measurements pre￾serve the two-colorability of the underlying graph. Whereas local σx- or σz-measurements in two￾colorable graphs yield graph states according to two-colorable graphs, σy-measurements of two￾colorable graphs can lead to graph states which are not even locally equivalent to two-colorable gr
Figure 13. – An example of an equivalence class which
Figure 14. – The Petersen Graph. The depicted labeled graph is n
Figure 15. – Any connected sub￾graph on three vertices gives rise to a violation of local real￾ism. As discussed in sec. 2 . 2 these stabilizer elements provide con￾straints to the four different measurement settings (I) ma xmNa z = 1 (III) mc xmNc z = 1 (II) mb xmNb z = 1 (IV ) − ma xmb xmc xmNa+Nb+Nc z = 1 , where ma x = ±1 and ma z = ±1 denote the measurement out￾comes if the qubit at vertex a is measured in spin-x- or z￾direction. More precisely any LHV model, which assigns prede￾termined( 45) values mx, mz to measurement outcomes to x-and z-measurements at the different vertice
Figure 16. – A single σy-measurement at an arbitrary vertex in the complete graph No. 7 suffices to disen￾tangle the corresponding state. Similarly, a single σz￾measurement at the central vertex in the graphs No. 1–6 or a single σx-measurement at the non-central vertices is a disentangling measurement. This is due to the fact that all graphs (No. 1–7) are locally equiv￾alent by LC-unitaries, which transform the measure￾ment basis correspondingly. For graphs with many edges a combina￾tion of σz and σy will give better bounds than restricting to σz measurements only. For ex￾ample, according to…
Figure 17. – An example for the (4, 5, 3)-cluster state and the graph corresponding to the adjacency matrix Γ AB (see eq. (116)) for a bipartitioning (A,B) with maximal Schmidt rank SRA = SRmax. Here the vertices in A are depicted by small boxes . Let us now apply these findings to evaluate the Schmidt measure for some important classes of graph states: Proposition 21 (Examples). • The Schmidt measure for any multi–partite GHZ states is 1. • The Schmidt measure of a 1D-, 2D-, 3D-cluster state is ⌊ N 2 ⌋. • The Schmidt measure of an entangled ring with an even number N of vertices is given by
Figure 18. – The graph No. 1 represents a tree. Its bi-partition
Figure 19. – Graph No. 1 is an entangled ring on 18 ver￾tices. Graph No. 2 represents the graph correspond￾ing to the adjacency matrix Γ AB (see eq. (116)) for a bipartitioning (A, B) with maximal Schmidt rank SRA = SRmax. The vertices of partition A are de￾picted by boxes
Figure 20. – Resource graph state for the con￾catenated [7, 1, 3]-CSS code. In the remainder we will briefly discuss two exam￾ples which were already introduced in sec. 4 in the con￾text of quantum error correction and the one-way model for quantum computation, namely the graph that is used to realize the QFT on three qubits in the one-way quan￾tum computer. The vision behind this is to flesh out the notion of entanglement as an algorithmic resource, as it has been put forward in ref. [32, 33, 34, 35]. Example 1: Concatenated [7, 1, 3]-CSS-code. As discussed in sec. 4 . 3 the graph G depicted…
Figure 21. – Graphs associated with the QFT on 3 qubits in the one-way quantum com￾puter. The boxes denote the input (left) and output (right) vertices. The graph No. 1 in fig. 21 is a simple example of an entangled graph state as it occurs in the one-way computer of refs. [32, 33, 34, 35]. This specific ex￾ample represents the initial resource (part of a cluster) required for the quantum Fourier transform QFT on 3 qubits [32, 33, 34, 35]. It has Schmidt measure 15, where the partition A = {2, 4, 7, 9, 11, 13, 15, 18, 20, 22, 24, 26, 28, 30, 32} is a minimal vertex cover with maximal Schmidt r
Figure 22. – Schematical drawing of a semi￾quantal Boltzmann gas [51]. Finally we will slightly change the physical setup and consider a spin gas that is a system of in￾teracting spins with coupling strengths that are now stochastic functions in time [51]. One example is given by a semi-quantal Boltzmann gas of parti￾cles where each particle follows a classical trajec￾tory but carries a quantum degree of freedom that is affected whenever two particles collide. During a collision of two particles, the internal degrees of freedom interact and can become entangled. This model was introduced in…
Figure 23. – For the case of particles in rings of size
Figure 24. – Under individual coupling due to the same

Figures reproduced from arXiv:quant-ph/0602096 by the authors.

References
How later papers used it

219 later papers cite it

Evidence: substantial. 199 of the citing papers share no author with it, and 21 of those carry a confident label from Pith's citation classifier.

Pith read 17 of the 483 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Uses its method or tool 5 of 16 papers with this label · 1 by the same authors

By the same authors

How the literature uses it

211 arXiv papers cite this in 474 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 268 sentences without a confident label

Builds on it 3 papers
Uses its method or tool 15 papers
  • To this end, an algorithm described in [ref] and originally derived in [ref] was employed, according to which two graphs $G$ and $G^'$ with adjacency matrices [That is, matrices with one column/row for each vertex, a $1$ at the corresponding position if two vertices are connected and a $0$ otherwise.] $Γ$ and $Γ^'$ are equivalent under local complementations iff there exist diagonal matrices $𝐀,𝐁,𝐂,𝐃∈𝔽_2^N×N$, such that the non-linear condition $𝐀𝐃+𝐁𝐂=𝐄$ and the system of linear equations [equation] are satisfied over the Galois field $𝔽_2$ ($𝐄$ denotes the identity matrix).

    Minimal instances for toric code ground states · Methods · 1.00

  • We therefore calculate the localizable entanglement between the first P$_1$ and last P$_N$ photonic qubit [ref] .

    Deterministic generation of a 20-qubit two-dimensional photonic cluster state · State characterization · 0.96

  • To do so we follow the procedure described in the paper of Zhao et al. [ref] which efficiently and uniquely encodes the graphs [ref] , as set out here.

    On quantum invariants and the graph isomorphism problem · Constructing Graph States · 1.00

Compares with it 2 papers
Cites it as support 1 paper
Cites it as background 121 papers

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.