Cited by 1,950Quantum Information and CryptographyQuantum many-body systemsQuantum Mechanics and Applications

Persistent Entanglement in Arrays of Interacting Particles

Open access
Briegel, Hans J., Raussendorf, Robert·2001·Physical Review Letters

Abstract

We study the entanglement properties of a class of N-qubit quantum states that are generated in arrays of qubits with an Ising-type interaction. These states contain a large amount of entanglement as given by their Schmidt measure. They also have a high persistency of entanglement which means that approximately N/2 qubits have to be measured to disentangle the state. These states can be regarded as an entanglement resource since one can generate a family of other multiparticle entangled states such as the generalized Greenberger-Horne-Zeilinger states of

AI snapshot

Written from the paper’s full text.

TL;DR

The paper introduces a class of highly entangled N-qubit states generated by Ising-type interactions in qubit arrays, characterized by maximal connectedness and high persistency of entanglement. For a one-dimensional chain, the state \(|\phi_N\rangle\) has persistency and Schmidt measure both equal to \(\lfloor N/2\rfloor\), making it more entangled than GHZ states in operational terms.

Key findings

  • For the 1D chain state \(|\phi_N\rangle\), the authors prove it is maximally connected, has persistency \(P_e(|\phi_N\rangle)=\lfloor N/2\rfloor\), and has Schmidt measure \(P_S(|\phi_N\rangle)=\lfloor N/2\rfloor\); its minimum product-term expansion requires \(2^{\lfloor N/2\rfloor}\) terms.
  • Comparing \(|\phi_4\rangle\) and \(|GHZ_4\rangle\): both are maximally connected, but their persistencies are \(P_e=2\) and \(P_e=1\), respectively; a single local measurement can disentangle \(|GHZ_4\rangle\), while it cannot destroy all entanglement of \(|\phi_4\rangle\).
  • The W state \(|W_N\rangle\) has Schmidt measure \(\log_2 N\) and persistency \(N-1\), so it is harder to destroy by local measurements than \(|\phi_N\rangle\), but it is not maximally connected.
  • For higher-dimensional cluster states, all are maximally connected; for large convex clusters the asymptotic persistency is \(P_e/N=1/2\) as \(N\to\infty\), and from a block of \(L^d\) qubits one can obtain generalized GHZ states on any subset \(C'\subset C\cap\{2\mathbb Z\}^d\).

Methods

  • Theoretical quantum-information study of N-qubit states generated in arrays with an Ising-type interaction, confined to next-neighbor interactions; the 1D chain and d=2,3 lattice clusters are analyzed.
  • The paper defines maximal connectedness and persistency of entanglement, then uses local von Neumann measurements, LOCC, Schmidt measure, eigenvalue equations, induction, and upper/lower bounds to prove entanglement properties.
  • No experimental data or sample is analyzed; optical lattices are discussed as a possible experimental realization.

Limitations

  • The paper states it confines itself to next-neighbor interactions, with a more general situation to be reported in [8].
  • Detailed proofs for higher-dimensional cluster results and the LOCC obtainability result are deferred to a longer paper [8]; the latter is noted “without proof.”
  • The exact persistency depends on the shape of a cluster, and only an asymptotic result \(P_e/N=1/2\) is given for large convex clusters.
  • Evident from the text: the work is theoretical, with no experimental demonstration; optical-lattice implementation is proposed but not performed.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.86.910

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 13 cited sources checked · 0 supported · 0 flagged

  • Findingcitation
    § Persistent entanglement in arrays of interacting particles · p. 2

    The persistency of the states |φ_N〉 is equal to their Schmidt measure.

    “the persistency of the states | φ N 〉 is equal to their Schmidt measure [15]”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [15]

      Not checked in the free run.

  • Findingcitation
    § Persistent entanglement in arrays of interacting particles · p. 2

    The state |φ_4〉 is not equivalent to a 4-qubit GHZ state.

    “| φ 4 〉 is not equivalent to a 4-qubit GHZ state [4].”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [4] source

      Not checked in the free run.

  • Findingcitation
    § Persistent entanglement in arrays of interacting particles · p. 3

    The persistency of |W_N〉 is N-1.

    “The persistency of | W N 〉 , on the other hand, is given by N -1 [16]”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [16]

      Not checked in the free run.

  • Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 3

    The Schmidt measure of |φ_N〉 is ⌊N/2⌋.

    “the Schmidt measure P S ( | φ N 〉 ) [15] of | φ N 〉 is equal to log 2 ( r ) = ⌊ N/ 2 ⌋ .”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [15]

      Not checked in the free run.

  • Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 3

    The minimum number of product terms in an expansion of |φ_N〉 is 2^{⌊N/2⌋}.

    “it follows by induction that r = 2 ⌊ N/ 2 ⌋ .”
    Quote in the paperSubstantial claim
  • May combine two claims. 10
  • Classified as probably not a substantial claim. 2
  • May combine two claims.

    Findingnone given
    § Persistent entanglement in arrays of interacting particles · p. 2

    Both |φ_4〉 and |GHZ4〉 are maximally connected.

    “both states | φ 4 〉 and | GHZ4 〉 are maximally connected”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingnone given
    § Persistent entanglement in arrays of interacting particles · p. 2

    The persistency of |φ_4〉 is P_e=2 and the persistency of |GHZ4〉 is P_e=1.

    “while their persistency is P e = 2 and P e = 1, respectively.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 3

    The state |φ_N〉 can be disentangled by measuring σ_z of all even numbered qubits, requiring ⌊N/2⌋ measurements, which gives an upper bound P_e(|φ_N〉) ≤ ⌊N/2⌋.

    “An explicit strategy to disentangle state (2) is to measure σ ( j ) z of all even numbered qubits, j = 2 , 4 , 6 , . . . , which can easily be verified. The total number of these measurements is ⌊ N/ 2 ⌋ , which gives an upper bound to the persistency, i.e. P e ( | φ N 〉 ) ≤ ⌊ N/ 2 ⌋ .”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 3

    The operators {K_a | a∈C} form a complete set of commuting observables of which the cluster states |Φ〉_C are eigenstates.

    “The operators { K a | a ∈ C} form a complete set of commuting observables of which the cluster states | Φ 〉 C are are eigenstates.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 1

    For g(t)=g=const, U(φ)=U(gt) is periodic in time and generates entanglement oscillations of the chain.

    “For g ( t ) = g =const, U ( ϕ ) = U ( gt ) is periodic in time and generates 'entanglement oscillations' of the chain.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingcitation
    § Persistent entanglement in arrays of interacting particles · p. 4

    The Schmidt entanglement measure of the states obtained from a cluster by LOCC is always smaller than that of the original cluster state, so the total amount of entanglement decreases.

    “Even though the thereby obtained states are highly entangled, their Schmidt entanglement measure [15] is always smaller than of the original cluster state, and so the total amount of entanglement decreases.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [15]

      Not checked in the free run.

  • May combine two claims.

    Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 3

    P_S(|φ_N〉)=⌊N/2⌋ ≤ P_e(|φ_N〉) ≤ ⌊N/2⌋, which proves property (ii).

    “Together with (iii) we obtain P S ( | φ N 〉 ) = ⌊ N/ 2 ⌋ ≤ P e ( | φ N 〉 ) ≤ ⌊ N/ 2 ⌋ which proves property (ii).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingnone given
    § Persistent entanglement in arrays of interacting particles · p. 1

    For φ=0,2π,4π,..., the chain is disentangled, while for all other values of φ, it is entangled.

    “For the specific values ϕ = 0 , 2 π, 4 π, . . . the chain is disentangled, while for all other values of ϕ , it is entangled.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingreasoning
    § Persistent entanglement in arrays of interacting particles · p. 3

    The property of maximal connectedness of |Φ〉_C does not depend on the precise shape of the cluster, and not even on its topological characterization except for being a cluster.

    “It is noteworthy that the property of maximal connectedness of | Φ 〉 C does not depend on the precise shape of the cluster, and not even on its topological characterization except for being a cluster.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § Persistent entanglement in arrays of interacting particles · p. 3

    Any state obtained from |W_N〉 by tracing over N-2 qubits is inseparable.

    “who showed that any state obtained from | W N 〉 by tracing over N -2 qubits is inseparable.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [3] source

      Not checked in the free run.

  • May combine two claims.

    Interpretationnone given
    § Persistent entanglement in arrays of interacting particles · p. 4

    The cluster states have a large persistency of entanglement which quantifies the operational effort needed to disentangle these states.

    “The cluster states have a large persistency of entanglement which quantifies the operational effort needed to disentangle these states.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning
    § Persistent entanglement in arrays of interacting particles · p. 4

    Experimentally, these states could be generated and studied in optical lattices or similar systems.

    “Experimentally, these states could be generated and studied in optical lattices or similar systems.”
    Quote in the paperNot a substantial claim
12 of 12
  • The authors state this as an assumption.

    The qubits are distributed between remote parties which can only act through local operations and classical communication (LOCC).

    “by assuming, as usual, that the qubits are distributed between remote parties which can only act through LOCC.”
1 of 1

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Cluster states can be created by a controllable Ising-type interaction (Briegel and Raussendorf, 2001; Raussendorf and Briegel, 2001; Raussendorf et al., 2003).

    “Cluster states can be created by a controllable Ising-type interaction (Briegel and Raussendorf, 2001;Raussendorf and Briegel, 2001;Raussendorf et al., 2003).”

    From Multiphoton entanglement and interferometry (2012) · cites this paper as Briegel and Raussendorf, 2001

  • The entanglement in the 4-qubit cluster state |φ_C4 cannot be destroyed by a single local operation.

    “In particular, the entanglement in |φ C4 cannot be destroyed by a single local operation [2].”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [2]

  • The one-way quantum computer (QC_C) is a scheme of quantum computation that consists entirely of one-qubit measurements on cluster states.

    “We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states.”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [2]

  • The minimum number of required terms to write down a cluster state in explicit form scales exponentially with the number of qubits.

    “In fact, to write down a cluster state in its explicit form would be quite space-consuming since the minimum number of required terms scales exponentially with the number of qubits [2]”

    From Measurement-based quantum computation on cluster states (2003) · cites this paper as [2]

  • In one-way quantum computation, the resource state (2D-cluster state) is prepared independently of the quantum algorithm to be implemented.

    “the system is first prepared in a highly entangled quantum state, the 2D-cluster state 20 (see Fig. 1), independently of the quantum algorithm which is to be implemented”

    From Measurement-based quantum computation (2009) · cites this paper as [20]

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Two stated expansions of the extended chain disagree

    Minor

    The first expansion gives a state proportional to |φN〉 when the two added qubits are projected onto |0〉 in the z basis. The expression said to be the same instead gives a state proportional to σz acting on qubit N of |φN〉. These are not the same state for an entangled chain.

1 of 1

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Briegel, H. J., & Raussendorf, R.
Affiliations
Ludwig-Maximilians-Universität München (DE)
Venue
Physical Review Letters
Published
2001-01-29
Volume
86
Issue
5
Pages
910-913
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1997837296
Cited by
1,950
References
12
Citations by year
2026: 44 · 2025: 103 · 2024: 114 · 2023: 151 · 2022: 60 · 2021: 80 · 2020: 70 · 2019: 75 · 2018: 75 · 2017: 58 · 2016: 77 · 2015: 63 · 2014: 82 · 2013: 84 · 2012: 80
FWCI
24.57
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Technische Universität Dortmund Eldorado (Technische Universität Dortmund) (submittedVersion)
  • arXiv (Cornell University)
  • Technische Universität Dortmund Eldorado (Technische Universität Dortmund)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
multipartite entanglement, Ising interaction, qubit arrays, disentanglement, entanglement resource, generalized GHZ states, n-qubit states

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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-09.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-09.

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