Persistent Entanglement in Arrays of Interacting Particles
Open accessAbstract
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
Cites
Statistics
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
- Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 2
The states |φ_N〉 and the N-qubit GHZ state |GHZ_N〉 are not equivalent for N > 3, i.e. cannot be transformed into each other by LOCC.
“More generally, the states | φ N 〉 and the N -qubit GHZ state | GHZ N 〉 ≡ 2 -1 / 2 ( | 0 〉 1 . . . | 0 〉 N ) + | 1 〉 1 . . . | 1 〉 N ) are not equivalent for N > 3 i.e. cannot be transformed into each other by LOCC (local transformations and classical communication) as we shall see below.”
Quote in the paperSubstantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 3
The persistency of |GHZ_N〉 equals its Schmidt measure.
“This result also holds for the state | GHZ N 〉 .”
Quote in the paperSubstantial claim - Findingcitation§ Persistent entanglement in arrays of interacting particles · p. 3
The Schmidt measure of |W_N〉 is log2(N).
“The Schmidt measure of this state is equal to log 2 ( N )”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [3] source
Not checked in the free run.
- Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 1
The N-qubit states generated in arrays of qubits with an Ising-type interaction contain a large amount of entanglement as given by their Schmidt measure.
“These states contain a large amount of entanglement as given by their Schmidt measure.”
Quote in the paperNot a substantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 2
For the state |φ_N〉, it is maximally connected.
“for the state | φ N 〉 we show that (i) it is maximally connected”
Quote in the paperSubstantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 2
The persistency of |φ_N〉 is P_e(|φ_N〉)=⌊N/2⌋.
“its persistency is P e ( | φ N 〉 ) = ⌊ N/ 2 ⌋ .”
Quote in the paperSubstantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 2
For N=2, the state |φ_2〉 is a maximally entangled state.
“which is a maximally entangled state.”
Quote in the paperNot a substantial claim - Findingcitation§ Persistent entanglement in arrays of interacting particles · p. 2
The state |φ_3〉 corresponds to a GHZ state of three qubits.
“While | φ 3 〉 corresponds to a GHZ state of three qubits [7]”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [7] source
Not checked in the free run.
- Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 1
These states have a high persistency of entanglement, meaning that approximately N/2 qubits have to be measured to disentangle the state.
“They have also a high persistency of entanglement which means that ∼ N/ 2 qubits have to be measured to disentangle the state.”
Quote in the paperSubstantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
By measuring all neighboring qubits surrounding a path P in the σ_z basis, the qubits on path P are projected into a state that is, up to local unitary transformations, identical to the state |Φ_N〉 of the linear chain.
“By this procedure, we project the qubits on path P into a state that is, up to local unitary transformations, identical to the state | Φ N 〉 of the linear chain.”
Quote in the paperSubstantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 2
Any two of the four qubits in either |φ_4〉 or |GHZ4〉 can be projected into a Bell state by measuring the other two qubits in an appropriate basis.
“The states share the property that any two of the four qubits can be projected into a Bell state by measuring the other two qubits in an appropriate basis.”
Quote in the paperSubstantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
Equations (6) can be used to calculate the persistency, as they imply strict correlations among 1-particle measurements.
“Equations (6) can also be used to calculate the persistency, as they imply strict correlations among 1-particle measurements.”
Quote in the paperSubstantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 3
The state |W_N〉 is not maximally connected.
“Note however that, different from | φ N 〉 and | GHZ N 〉 , the state | W N 〉 is not maximally connected.”
Quote in the paperNot a substantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 1
For φ=π,3π,5π,..., the chain is in some sense maximally entangled.
“For the values ϕ = π, 3 π, 5 π, . . . the chain is in some sense maximally entangled and we will concentrate on this situation in the following.”
Quote in the paperSubstantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 3
All cluster states are maximally connected.
“We find that all cluster states are maximally connected.”
Quote in the paperSubstantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 3
The Schmidt measure gives a lower bound to the persistency.
“On the other hand, the Schmidt measure gives a lower bound to the persistency.”
Quote in the paperSubstantial claim - Findingcitation§ Persistent entanglement in arrays of interacting particles · p. 4
From a block C of L^d qubits, one can obtain any state of the form α|00...0〉_{C'} + β|11...1〉_{C'} of any subset C'⊂ C∩{2Z}^d.
“We note without proof [8] that from a block C of L d qubits, one can obtain any state of the form α | 00 . . . 0 〉 C ′ + β | 11 . . . 1 〉 C ′ of any subset of qubits C ′ ⊂ C ∩ { 2 Z } d .”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [8] source
Not checked in the free run.
- Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 4
In general, the exact value of the persistency depends on the shape of a cluster.
“In general, the exact value of the persistency depends on the shape of a cluster.”
Quote in the paperNot a substantial claim - Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
For large convex clusters, the asymptotic persistency per qubit is P_e/N = 1/2 as N→∞.
“For large convex clusters, we can give the asymptotic result P e /N = 1 / 2 where N →∞ is the number of qubits.”
Quote in the paperSubstantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 4
For the chain of qubits in the state |φ_N〉, the value of the persistency agrees with the Schmidt measure of |φ_N〉.
“For the chain of qubits in the state | φ N 〉 , we have shown that the value of the persistency agrees with the Schmidt measure of | φ N 〉 .”
Quote in the paperSubstantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 3
The cluster states (5) satisfy the eigenvalue equations (6).
“The cluster states (5) satisfy the following set of eigenvalue equations:”
Quote in the paperSubstantial claim - Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 2
It is impossible to destroy all entanglement of |φ_4〉 by a single local operation, such as a von Neumann measurement or complete depolarization of a qubit.
“In fact, it is impossible to destroy all entanglement of | φ 4 〉 by a single local operation, such as a von Neumann measurement or complete depolarization of a qubit.”
Quote in the paperNot a substantial claim - Interpretationnone given§ Persistent entanglement in arrays of interacting particles · p. 1
These states can be regarded as an entanglement resource because one can generate a family of other multi-particle entangled states, such as generalized GHZ states of fewer than N/2 qubits, by simple measurements and classical communication (LOCC).
“These states can be regarded as an entanglement resource since one can generate a family of other multi-particle entangled states such as the generalized GHZ states of < N/ 2 qubits by simple measurements and classical communication (LOCC).”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 3
The amount of entanglement contained in |W_N〉 is smaller, in fact exponentially smaller, than in |φ_N〉.
“which means that the amount of entanglement contained in | W N 〉 is smaller, in fact exponentially smaller, than in the state | φ N 〉 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 2
The state |φ_N〉 of the qubit chain is much more entangled than most of the known N-qubit states.
“In that sense, the state | φ N 〉 of the qubit chain is indeed much more entangled than most of the known N qubit states.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 3
The entanglement of |W_N〉 is harder to destroy by local measurements than that of |φ_N〉.
“which means that the entanglement of | W N 〉 is harder to destroy by local measurements than that of | φ N 〉 .”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
These correlations can be used to minimize the number of measurements required to project |Φ〉_C into a product state.
“These correlations can be used to minimize the number of measurements required to project | Φ 〉 C into a product state.”
Quote in the paperNot a substantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
The state |φ_N〉 is indeed much more entangled than most known N-qubit states.
“In that sense, the state | φ N 〉 is indeed much more entangled than most known N qubit states.”
Quote in the paperSubstantial claim - Premisecitation§ Persistent entanglement in arrays of interacting particles · p. 4
Optical lattices can implement the interaction (1) by cold atomic collisions or other techniques.
“one has identified systems such as 'optical lattices' [17,18] in which the interaction (1) can be implemented by cold atomic collisions [18] or other techniques.”
Quote in the paperSubstantial claim0 of 2 sources checked- cites [17]
Not checked in the free run.
- cites [18]
Not checked in the free run.
- Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
The unitary transformation U(φ) with φ=π can be realized by a single global operation.
“The unitary transformation U ( ϕ ) [before eq.(2)] with ϕ = π can thereby be realized by a single global operation.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 2
The parties may use either |φ_4〉 or |GHZ4〉 to teleport a qubit between any of the four parties.
“In other words, the parties may use either of the states | φ 4 〉 or | GHZ4 〉 to teleport [12] a qubit between any of the four parties.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [12]
Not checked in the free run.
- Premisenone given§ Persistent entanglement in arrays of interacting particles · p. 1
The interaction Hamiltonian is equivalent to the quantum Ising model with H'_int = -∑_{a,a'} 1/4 ħ g(t) f(a-a') σ^{(a)}_z σ^{(a')}_z.
“Concerning the entanglement properties of the states we are going to investigate, this interaction Hamiltonian is equivalent to the quantum Ising model with H ′ int = -∑ a,a ′ 1 4 ℏ g ( t ) f ( a -a ′ ) σ ( a ) z σ ( a ′ ) z , where the indices a, a ′ run over all occupied lattices sites.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
This enables one, in principle, to create a variety of multi-particle entangled states such as |GHZ_M〉 with M≫3 by the entanglement operation U(φ), followed by 1-qubit measurements and subsequent 1-qubit rotations.
“This enables one, in principle, to create a variety of multi-particle entangled states such as | GHZM 〉 with M ≫ 3 by the entanglement operation U ( ϕ ), followed by 1-qubit measurements and subsequent 1-qubit rotations (compare Fig. 1b).”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
The two- and three-dimensional problem is thereby reduced to the one-dimensional problem.
“We have thereby reduced the two- and three-dimensional problem to the one-dimensional problem.”
Quote in the paperSubstantial claim - Interpretationnone given§ Persistent entanglement in arrays of interacting particles · p. 1
The interaction (1) realizes simultaneous conditional phase gates between qubits at neighboring sites a and a'.
“In the language of quantum information, the interaction (1) realizes simultaneous conditional phase gates between qubits at neighboring sites a and a ′ .”
Quote in the paperSubstantial claim - Interpretationnone given§ Persistent entanglement in arrays of interacting particles · p. 4
The cluster states can be regarded as a scalable resource for other multi-qubit entangled states, such as multiparticle GHZ states.
“The cluster states can be regarded as a (scalable) resource for other multi-qubit entangled states, such as multiparticle GHZ states.”
Quote in the paperSubstantial claim - Premisenone given§ Persistent entanglement in arrays of interacting particles · p. 4
These systems allow one to switch on and off the coupling g(t) between all qubits simultaneously by manipulating the parameters of the trapping lasers.
“These systems allow one, in particular, to switch on and off the coupling g ( t ) between all qubits simultaneously by a manipulation of the parameters of the trapping lasers.”
Quote in the paperSubstantial claim - Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4
For α=β=1/√2, this includes the family of generalized (multiparticle) GHZ states on this subset.
“For α = β = 1 / √ 2, this includes, in particular, the family of generalized (multiparticle) GHZ states on this subset.”
Quote in the paperNot a substantial claim - Premisecitation§ Persistent entanglement in arrays of interacting particles · p. 2
For the state |GHZ4〉, a single local measurement suffices to bring it into a product state.
“For the state | GHZ4 〉 , in contrast, a single local measurement suffices to bring it into a product state [13].”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [13]
Not checked in the free run.
- 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. 2Both |φ_4〉 and |GHZ4〉 are maximally connected.
“both states | φ 4 〉 and | GHZ4 〉 are maximally connected”
Quote in the paperSubstantial claimMay combine two claims.
Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 2The 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 claimMay combine two claims.
Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 3The 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 claimMay combine two claims.
Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 3The 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 claimMay combine two claims.
Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 1For 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 claimMay combine two claims.
Findingcitation§ Persistent entanglement in arrays of interacting particles · p. 4The 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. 3P_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 claimMay combine two claims.
Findingnone given§ Persistent entanglement in arrays of interacting particles · p. 1For φ=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 claimMay combine two claims.
Findingreasoning§ Persistent entanglement in arrays of interacting particles · p. 3The 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 claimProbably not a substantial claim: may not pass S3 (load-bearing).
Premisecitation§ Persistent entanglement in arrays of interacting particles · p. 3Any 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. 4The 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 claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationreasoning§ Persistent entanglement in arrays of interacting particles · p. 4Experimentally, 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
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.”
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]
The 2D-cluster state is a universal resource for measurement-based quantum computation.
“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-one thus calls the cluster state a 'universal resource'.”
From Measurement-based quantum computation (2009) · cites this paper as [20]
In optical lattices, tuning the polarization of trapping lasers can induce entangling interactions between neighboring atoms and create a cluster state across the whole lattice.
“Tuning the polarization of the trapping lasers can induce entangling interactions 22,23 between neighboring atoms across the array and create a cluster state across the whole lattice 20,24,25 .”
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
MinorThe 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 , 2 , 3 , . . . , N, N +1 , N +2 }〉 chain = |{ 1 , 2 , 3 , . . . , N }〉 chain ( | 0 〉 N +1 - | 1 〉 N +1 σ ( N ) z ) ( | 0 〉 N +2 -| 1 〉 N +2 σ ( N +1) z )”
“| φ N +2 〉 = | φ N 〉| 0 〉 x,N +1 | 1 〉 z,N +2 -( σ ( N ) z | φ N 〉 ) | 1 〉 x,N +1 | 0 〉 z,N +2 .”
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · see citing works
Concentrating partial entanglement by local operations
Bennett, C. H., Bernstein, H. J., Popescu, S., & Schumacher, B. W. (1996) · Physical Review A · doi:10.1103/physreva.53.2046 · Cited by 3,051 · see citing works
Bell’s theorem without inequalities
Greenberger, D. M., Horne, M. A., Shimony, A., & Zeilinger, A. (1990) · American Journal of Physics · doi:10.1119/1.16243 · Cited by 2,404 · see citing works
The Physics of Quantum Information
Bouwmeester, D., EKERT, A. K., & Zeilinger, A. (2000) · Springer eBooks · doi:10.1007/978-3-662-04209-0 · Cited by 1,988 · see citing works
Entanglement of Atoms via Cold Controlled Collisions
Jaksch, D., Briegel, H.-J., Cirac, J. I., Gardiner, C. W., & Zoller, P. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1975 · Cited by 795 · see citing works
Self-citationQuantum Logic Gates in Optical Lattices
Brennen, G. K., Caves, C. M., Jessen, P., & Deutsch, I. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1060 · Cited by 659 · see citing works
Generalized Schmidt Decomposition and Classification of Three-Quantum-Bit States
Acín, A., Andrianov, A. A., Costa, L., Jané, E., Latorre, J. I., & Tarrach, R. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.1560 · Cited by 521 · see citing works
Classification of multiqubit mixed states: Separability and distillability properties
Dür, W., & Cirac, J. I. (2000) · Physical Review A · doi:10.1103/physreva.61.042314 · Cited by 291 · see citing works
Separability and Distillability of Multiparticle Quantum Systems
Dür, W., Cirac, J. I., & Tarrach, R. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.3562 · Cited by 279 · see citing works
Bell inequality, Bell states and maximally entangled states for n qubits
Gisin, N., & Bechmann-Pasquinucci, H. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00516-7 · Cited by 270 · see citing works
Nonlinear operations in quantum-information theory
Terno, D. R. (1999) · Physical Review A · doi:10.1103/physreva.59.3320 · Cited by 52 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477 · see citing works
Self-citationEntanglement in many-body systems
Amico, L., Fazio, R., Osterloh, A., & Vedral, V. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.517 · Cited by 3,745 · see citing works
Gühne, O., & Tóth, G. (2009) · Physics Reports · doi:10.1016/j.physrep.2009.02.004 · Cited by 2,401 · see citing works
Ultracold atomic gases in optical lattices: mimicking condensed matter physics and beyond
Lewenstein, M., Sanpera, A., Ahufinger, V., Damski, B., Sen(De), A., & Sen, U. (2007) · Advances in Physics · doi:10.1080/00018730701223200 · Cited by 2,104 · see citing works
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 · see citing works
Self-citationQuantum computation and quantum-state engineering driven by dissipation
Verstraete, F., Wolf, M. M., & Ignacio Cirac, J. (2009) · Nature Physics · doi:10.1038/nphys1342 · Cited by 1,570 · see citing works
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · see citing works
Multiphoton 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 · see citing works
“…step is the discovery of “one-way quantum computing” (Raussendorf and Briegel, 2001; Raussendorf et al., 2003), which is based on the preparation of highly entangled multi-qubit states, the so-called “cluster states” (Briegel and Raussendorf, 2001) and on simple adaptive one-qubit measurements.”
BackgroundInfluentialExperimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273 · see citing works
“A significant step forward in our understanding was the introduction of the “one-way” quantum computer 13-17 which highlights the importance of both measurement and entanglement in a striking way.”
BackgroundMethodMeasurement-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 · see citing works
Self-citationControlled collisions for multi-particle entanglement of optically trapped atoms
Mandel, O., Greiner, M., Widera, A., Rom, T., Hänsch, T. W., & Bloch, I. (2003) · Nature · doi:10.1038/nature02008 · Cited by 789 · see citing works
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790 · see citing works
Trotzky, S., Cheinet, P., Fölling, S., Feld, M., Schnorrberger, U., Rey, A. M., Polkovnikov, A., Demler, E. A., Lukin, M. D., & Bloch, I. (2008) · Science · doi:10.1126/science.1150841 · Cited by 698 · see citing works
Area Laws in Quantum Systems: Mutual Information and Correlations
Wolf, M. M., Verstraete, F., Hastings, M. B., & Cirac, J. I. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.070502 · Cited by 696 · see citing works
Experimental entanglement of six photons in graph states
Lu, C.-Y., Zhou, X.-Q., Gühne, O., Gao, W.-B., Zhang, J., Yuan, Z.-S., Goebel, A., Yang, T., & Pan, J.-W. (2007) · Nature Physics · doi:10.1038/nphys507 · Cited by 683 · see citing works
Classical simulation of quantum many-body systems with a tree tensor network
Shi, Y.-Y., Duan, L.-M., & Vidal, G. (2006) · Physical Review A · doi:10.1103/physreva.74.022320 · Cited by 577 · see citing works
<i>Colloquium</i>: Quantum networks with trapped ions
Duan, L.-M., & Monroe, C. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1209 · Cited by 530 · see citing works
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472 · see citing works
Generation of time-domain-multiplexed two-dimensional cluster state
Asavanant, W., Shiozawa, Y., Yokoyama, S., Charoensombutamon, B., Emura, H., Alexander, R. N., Takeda, S., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., et al. (2019) · Science · doi:10.1126/science.aay2645 · Cited by 476 · see citing works
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397 · see citing works
Self-citationHigh-speed linear optics quantum computing using active feed-forward
Prevedel, R., Walther, P., Tiefenbacher, F., Böhi, P., Kaltenbaek, R., Jennewein, T., & Zeilinger, A. (2007) · Nature · doi:10.1038/nature05346 · Cited by 373 · see citing works
A Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391 · see citing works
Valence-bond states for quantum computation
Verstraete, F., & Cirac, J. I. (2004) · Physical Review A · doi:10.1103/physreva.70.060302 · Cited by 333 · see citing works
Experimental Analysis of a Four-Qubit Photon Cluster State
Kiesel, N., Schmid, C., Weber, U., Tóth, G., Gühne, O., Ursin, R., & Weinfurter, H. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.210502 · Cited by 284 · see citing works
Entanglement detection in the stabilizer formalism
Tóth, G., & Gühne, O. (2005) · Physical Review A · doi:10.1103/physreva.72.022340 · Cited by 281 · see citing works
Novel Schemes for Measurement-Based Quantum Computation
Gross, D., & Eisert, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220503 · Cited by 255 · see citing works
Universal Resources for Measurement-Based Quantum Computation
Van den Nest, M., Miyake, A., Dür, W., & Briegel, H. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.150504 · Cited by 238 · see citing works
Self-citationMeasurement-based quantum computation beyond the one-way model
Gross, D., Eisert, J., Schuch, N., & Perez-Garcia, D. (2007) · Physical Review A · doi:10.1103/physreva.76.052315 · Cited by 236 · see citing works
Experimental Realization of One-Way Quantum Computing with Two-Photon Four-Qubit Cluster States
Chen, K., Li, C.-M., Zhang, Q., Chen, Y.-A., Goebel, A., Chen, S., Mair, A., & Pan, J.-W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.120503 · Cited by 204 · see citing works
General Entanglement Scaling Laws from Time Evolution
Eisert, J., & Osborne, T. J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.150404 · Cited by 201 · see citing works
Efficient Quantum Computation with Probabilistic Quantum Gates
Duan, L.-M., & Raussendorf, R. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.080503 · Cited by 185 · see citing works
Self-citationTensor Network Contractions: Methods and Applications to Quantum Many-Body Systems
Ran, S.-J., Tirrito, E., Peng, C., Chen, X., Tagliacozzo, L., Su, G., & Lewenstein, M. (2020) · Lecture Notes in Physics · doi:10.1007/978-3-030-34489-4 · Cited by 176 · see citing works
Demonstrating Anyonic Fractional Statistics with a Six-Qubit Quantum Simulator
Lu, C.-Y., Gao, W.-B., Gühne, O., Zhou, X.-Q., Chen, Z.-B., & Pan, J.-W. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.030502 · Cited by 132 · see citing works
Realization and Characterization of a Two-Photon Four-Qubit Linear Cluster State
Vallone, G., Pomarico, E., Mataloni, P., De Martini, F., & Berardi, V. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.180502 · Cited by 132 · see citing works
Brokered graph-state quantum computation
Benjamin, S. C., Browne, D. E., Fitzsimons, J., & Morton, J. J. L. (2006) · New Journal of Physics · doi:10.1088/1367-2630/8/8/141 · Cited by 128 · see citing works
Measurement as a Shortcut to Long-Range Entangled Quantum Matter
Lu, T.-C., Lessa, L. A., Kim, I. H., & Hsieh, T. H. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040337 · Cited by 115 · see citing works
Path-polarization hyperentangled and cluster states of photons on a chip
Ciampini, M. A., Orieux, A., Paesani, S., Sciarrino, F., Corrielli, G., Crespi, A., Ramponi, R., Osellame, R., & Mataloni, P. (2016) · Light: Science & Applications · doi:10.1038/lsa.2016.64 · Cited by 105 · see citing works
Classical simulation versus universality in measurement-based quantum computation
Van den Nest, M., Dür, W., Vidal, G., & Briegel, H. J. (2007) · Physical Review A · doi:10.1103/physreva.75.012337 · Cited by 95 · see citing works
Self-citationProducing Cluster States in Charge Qubits and Flux Qubits
Tanamoto, T., Liu, Y.-X., Fujita, S., Hu, X., & Nori, F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.230501 · Cited by 89 · see citing works
Fundamentals of universality in one-way quantum computation
Nest, M. V. D., Dür, W., Miyake, A., & Briegel, H. J. (2007) · New Journal of Physics · doi:10.1088/1367-2630/9/6/204 · Cited by 97 · see citing works
Self-citationTime-Domain-Multiplexed Measurement-Based Quantum Operations with 25-MHz Clock Frequency
Asavanant, W., Charoensombutamon, B., Yokoyama, S., Ebihara, T., Nakamura, T., Alexander, R. N., Endo, M., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., et al. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.034005 · Cited by 76 · see citing works
Cluster states from Heisenberg interactions
Borhani, M., & Loss, D. (2005) · Physical Review A · doi:10.1103/physreva.71.034308 · Cited by 68 · see citing works
Completeness of the Classical 2D Ising Model and Universal Quantum Computation
Van den Nest, M., Dür, W., & Briegel, H. J. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.110501 · Cited by 63 · see citing works
Self-citationQuantum-dot cluster-state computing with encoded qubits
Weinstein, Y. S., Hellberg, C. S., & Levy, J. (2005) · Physical Review A · doi:10.1103/physreva.72.020304 · Cited by 59 · see citing works
Statistical mechanical models and topological color codes
Bombin, H., & Martin-Delgado, M. A. (2008) · Physical Review A · doi:10.1103/physreva.77.042322 · Cited by 39 · see citing works
Browne, D., & Briegel, H. (2016) · Quantum Information · doi:10.1002/9783527805785.ch21 · Cited by 29 · see citing works
Self-citationAnalytical model for polarization-dependent light propagation in waveguide arrays and applications
Rojas-Rojas, S., Morales-Inostroza, L., Naether, U., Xavier, G. B., Nolte, S., Szameit, A., Vicencio, R. A., Lima, G., & Delgado, A. (2014) · Physical Review A · doi:10.1103/physreva.90.063823 · Cited by 20 · see citing works
Robust and scalable scheme to generate large-scale entanglement webs
Fujii, K., Maeda, H., & Yamamoto, K. (2011) · Physical Review A · doi:10.1103/physreva.83.050303 · Cited by 17 · see citing works
Measurement-Based Quantum Computation and Undecidable Logic
Van den Nest, M., & Briegel, H. J. (2008) · Foundations of Physics · doi:10.1007/s10701-008-9212-6 · Cited by 17 · see citing works
Self-citation
- Authors
- Briegel, H. J., & Raussendorf, R.
- Affiliations
- Ludwig-Maximilians-Universität München (DE)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-01-29
- Volume
- 86
- Issue
- 5
- Pages
- 910-913
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1997837296
- Semantic Scholar
- b50c61944fa0d7769b5621ad31fe6f5803d87eaa
- 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
- green
- arxiv.org
- 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