The DOI matches its Crossref record; 8 of the 22 references it cites were found in a registry or an index, and 14 are not checked yet; none of the 4 sources its claims cite is checked for support yet.
Perfect State Transfer in Quantum Spin Networks
Open accessAbstract
We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.
Checked 2026-10-06 · 14 references not checked yet
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proposes qubit networks that achieve perfect transfer of an arbitrary quantum state in a fixed time without switching qubit couplings. It shows perfect transfer in hypercubes and, with engineered fixed couplings, over arbitrarily long linear chains.
Key findings
- Perfect state transfer is possible between antipodes of one-link and two-link hypercubes, with constant transfer times \(t=\pi/2\) and \(t=\pi/\sqrt{2}\), respectively, independent of dimension.
- For \(N\)-qubit spin networks with identical couplings, the maximal perfect communication distance for hypercube geometries is \(2\log_3 N\); perfect transfer between antipodes of \(N\)-link hypercubes for \(N\ge 3\) is impossible.
- In an XY linear chain, perfect transfer occurs only for \(N=2\) and \(N=3\), with amplitudes \(F(t)=-i\sin(t)\) and \(F(t)=-[\sin(t\sqrt{2})]^2\); no perfect transfer occurs for \(N\ge 4\).
- With fixed but engineered couplings \(J_n=\frac{\lambda}{2}\sqrt{n(N-n)}\), perfect transfer over a chain of any length occurs in constant time \(t=\pi/\lambda\); a Heisenberg model with local magnetic fields can give the same dynamics.
Methods
- Theoretical analysis of continuous-time quantum walks on graphs: the network is a graph \(G\) with adjacency matrix \(A(G)\), and state-transfer dynamics is confined to the \(N\)-dimensional single-excitation subspace \(S_G\), where the Hamiltonian equals \(A(G)\).
- Perfect transfer is assessed via the amplitude \(F(t)=\langle N|e^{-iH_G t}|1\rangle\), with perfect transfer when \(|F(t)|=1\).
- The paper diagonalizes the XY linear chain, uses Cartesian products of two- and three-qubit chains to build hypercubes, and maps an engineered chain to a fictitious spin-\((N-1)/2\) particle governed by \(H=\lambda S_x\). No experimental data are used.
Limitations
- Stated: “we do not consider the effects of any other source of errors in this paper”; the paper also calls it an open problem whether an identical-coupling network can exceed the \(2\log_3 N\) distance.
- Stated: perfect transfer in an unmodulated XY linear chain is limited to \(N=2,3\), and perfect transfer between antipodes of \(N\)-link hypercubes for \(N\ge 3\) is impossible.
- Evident from the text: the scheme assumes idealized time-independent Hamiltonians and no dynamical control, requires pre-engineering couplings for arbitrary-length chains, and provides no experimental implementation or error analysis.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
32 No basis given · 8 Own interpretation · 4 Not checked yet · 3 Own result · 1 Own method
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“When restricted to N -qubit spin networks of identical qubit couplings, we show that 2 log 3 N is the maximal perfect communication distance for hypercube geometries.”
- Also stated in: § Perfect state transfer in quantum spin networks · p. 3 · boosted
“Thus we have shown that for a two-link hypercube of N sites, the maximum distance of perfect quantum communication is 2 log 3 N .”
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Perfect state transfer in quantum spin networks · p. 3 · boosted
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.”
- Also stated in: § Perfect state transfer in quantum spin networks · p. 4 · boosted
“In addition, we have shown that a quantum state can be transferred perfectly over a chain of any length as long as one can pre-engineer inter-qubit interactions.”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Perfect state transfer in quantum spin networks · p. 4 · boosted
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Perfect state transfer from one end of the chain to another is possible only for N = 2 and N = 3, with F ( t ) = -i sin( t ) and F ( t ) = -[ sin ( t √ 2 )] 2 respectively.”
plainn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This means that the state | 1 〉 ≡ | 1 A 00 · · · 00 B 〉 must evolve into a superposition of states with exactly one spin 'up' and all other spins 'down'.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“the same as in the engineered chain.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The above matrix, Eq. (13), is identical to the representation of the Hamiltonian H of a fictitious spin S = 1 2 ( N -1) particle: H = λS x , where S x is its angular momentum operator and λ is some constant.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The coefficient α does not change in time, as | 0 〉 is the zero-energy eigenstate of H G .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“with corresponding eigenvalues E k = -2 cos kπ N +1 for all k = 1 , . . . , N .”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The d -fold Cartesian product of a one-link chain (two qubits) and a two-link chain (three qubits) lead to onelink and two-link hypercubes with | F ( t ) | given, respectively, by”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 6
- Probably not a substantial claim. 6
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Perfect state transfer from one end of the chain to another is possible only for N = 2 and N = 3, with F ( t ) = -i sin( t ) and F ( t ) = -[ sin ( t √ 2 )] 2 respectively.”
plaincorrelationaln = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Any quantum state can be perfectly transferred between the two antipodes of the one-link and two-link hypercubes of any dimensions in constant time t = π/ 2 and t = π/ √ 2 respectively [14].”
What the sources say
- Not checked yetcites [14] Note that continuous time quantum walk on the 1-link hypercube has recently been studied by C. Moore and A. Russell in Randomization and Approximation Techniques: 6th International Workshop, (RANDOM 2002), Lecture Notes in Computer Science , (Springer-Verlag, Heidelberg), vol. 2483, p. 164. source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The Hilbert space H G associated with a network of N qubits is of dimension 2 N .”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“commutes with H G , which leads to the conservation of the total z -component of spin.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“These tasks can be also accomplished with the Heisenberg, or exchange, interaction by a suitable modulation of the network, e.g., by placing it in a static but, in general, non-uniform external magnetic field.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For fixed N it maximizes the distance between A and B .”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“An improvement of the perfect quantum communication distance to N is, however, possible if one allows for different, but fixed, couplings between qubits on a chain.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“The classical mean hitting time between the antipodes in a one-link and two-link d -dimensional hypercube is given, for large d , by 2 d and 3 d , respectively.”
What the sources say
- Not checked yetcites [12] A. Bovier, Markov processes and meta-stability: Lecture notes for the Technical University of Berlin (2003). source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It can also be used to transfer or to distribute quantum entanglement.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Quantum communication over short distances through an unmodulated spin chain has been studied in detail, and an expression for the fidelity of quantum state has been obtained [9].”
What the sources say
- Not checked yetcites [9] S. Bose, Phys. Rev. Lett. 91 , 207901 (2003); V. Subrahmanyam, Phys. Rev. A 69 , 034304 (2004). source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“However, note that we do not consider the effects of any other source of errors in this paper.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The authors state this as an assumption.
Initially all spins point down along a prescribed z-axis, i.e., the network is in the state |0> = |0_A 00...00_B>.
“we shall assume that initially all spins point 'down' along a prescribed z -axis, i.e. the network is in the state | 0 〉 = | 0 A 00 · · · 00 B 〉 .”
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Inspired by spin chains [100-102] (see figure 12(a)), by tailoring the hopping rates between the waveguides of an array to match the matrix elements of the J x angular momentum operator, such a task becomes possible.”
From Integrated photonic quantum walks (2020) · cites this paper as [102]
Experimental — accuracy not yet measuredIn the citing paper
“From Eq. (5), the evolution time is limited by the minimum energy interval ∆ min ≡ min { ∆ k } , τ ≥ π/ ∆ min , while ˜ τ = π/ ˜ ∆ min .”
From Quantum speed limit for perfect state transfer in one dimension (2006) · cites this paper as [11]
In the citing paper
“This work also implies that quantum algorithms, when implemented in solid state devices, can be optimized, if we employ the concept of spin chain engineering [11].”
From Quantum speed limit for perfect state transfer in one dimension (2006) · cites this paper as [11]
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.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Perfect state transfer in quantum spin networks · p. 3
“An improvement of the perfect quantum communication distance to N is, however, possible if one allows for different, but fixed, couplings between qubits on a chain.”
§ Perfect state transfer in quantum spin networks · p. 1
“We define the distance between A and B to be the number of edges constituting the shortest path between them.”
Citations
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
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum Communication through an Unmodulated Spin Chain
Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.207901 · Cited by 1,407
Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate
Leibfried, D., DeMarco, B., Meyer, V., Lucas, D., Barrett, M., Britton, J., Itano, W. M., Jelenković, B., Langer, C., Rosenband, T., et al. (2003) · Nature · doi:10.1038/nature01492 · Cited by 1,083
Universal quantum computation with the exchange interaction
DiVincenzo, D. P., Bacon, D., Kempe, J., Burkard, G., & Whaley, K. B. (2000) · Nature · doi:10.1038/35042541 · Cited by 924
Realization of the Cirac–Zoller controlled-NOT quantum gate
Schmidt-Kaler, F., Häffner, H., Riebe, M., Gulde, S., Lancaster, G. P. T., Deuschle, T., Becher, C., Roos, C. F., Eschner, J., & Blatt, R. (2003) · Nature · doi:10.1038/nature01494 · Cited by 875
Controlled 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
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Research works printed but not linked: 3
- 1978, Selected Topics in Graph Theory
- C. Moore, 2002, Randomization and Approximation Techniques: 6th International Workshop
- A. M. Childs, 2003, Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003)
Cited by
Sorted by citations
Entanglement 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
Environment-assisted quantum walks in photosynthetic energy transfer
Mohseni, M., Rebentrost, P., Lloyd, S., & Aspuru-Guzik, A. (2008) · The Journal of Chemical Physics · doi:10.1063/1.3002335 · Cited by 1,189
Quantum entanglement in condensed matter systems
Laflorencie, N. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.008 · Cited by 845
Perfect transfer of arbitrary states in quantum spin networks
Christandl, M., Datta, N., Dorlas, T. C., Ekert, A., Kay, A., & Landahl, A. J. (2005) · Physical Review A · doi:10.1103/physreva.71.032312 · Cited by 512
Self-citationUniversal quantum computation using the discrete-time quantum walk
Lovett, N. B., Cooper, S., Everitt, M., Trevers, M., & Kendon, V. (2010) · Physical Review A · doi:10.1103/physreva.81.042330 · Cited by 510
Quantum communication through spin chain dynamics: an introductory overview
Bose, S. (2007) · Contemporary Physics · doi:10.1080/00107510701342313 · Cited by 484
Continuous-time quantum walks: Models for coherent transport on complex networks
Mülken, O., & Blumen, A. (2011) · Physics Reports · doi:10.1016/j.physrep.2011.01.002 · Cited by 371
Exponential improvement in precision for simulating sparse Hamiltonians
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2014) · Proceedings of the forty-sixth annual ACM symposium on Theory of computing · doi:10.1145/2591796.2591854 · Cited by 324
PERFECT, EFFICIENT, STATE TRANSFER AND ITS APPLICATION AS A CONSTRUCTIVE TOOL
Kay, A. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006514 · Cited by 350
Mirror Inversion of Quantum States in Linear Registers
Albanese, C., Christandl, M., Datta, N., & EKERT, A. K. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.230502 · Cited by 265
Self-citationConclusive and arbitrarily perfect quantum-state transfer using parallel spin-chain channels
Burgarth, D. K., & Bose, S. (2005) · Physical Review A · doi:10.1103/physreva.71.052315 · Cited by 245
Unmodulated spin chains as universal quantum wires
Wójcik, A., Łuczak, T., Kurzyński, P., Grudka, A., Gdala, T., & Bednarska, M. (2005) · Physical Review A · doi:10.1103/physreva.72.034303 · Cited by 237
Kretschmann, D., & Werner, R. F. (2005) · Physical Review A · doi:10.1103/physreva.72.062323 · Cited by 259
Robust Quantum State Transfer in Random Unpolarized Spin Chains
Yao, N. Y., Jiang, L., Gorshkov, A. V., Gong, Z., Zhai, A., Duan, L.-M., & Lukin, M. D. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.040505 · Cited by 237
Thermal entanglement in a two-qubit Heisenberg XXZ spin chain under an inhomogeneous magnetic field
Zhang, G., & Li, S. (2005) · Physical Review A · doi:10.1103/physreva.72.034302 · Cited by 225
Spin chains as perfect quantum state mirrors
Karbach, P., & Stolze, J. (2005) · Physical Review A · doi:10.1103/physreva.72.030301 · Cited by 214
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
XY mixers: Analytical and numerical results for the quantum alternating operator ansatz
Wang, Z., Rubin, N. C., Dominy, J. M., & Rieffel, E. G. (2020) · Physical Review A · doi:10.1103/physreva.101.012320 · Cited by 190
Yung, M., & Bose, S. (2005) · Physical Review A · doi:10.1103/physreva.71.032310 · Cited by 190
Jones, J. A. (2010) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/j.pnmrs.2010.11.001 · Cited by 195
Coherent quantum transport in photonic lattices
Perez-Leija, A., Keil, R., Kay, A., Moya-Cessa, H., Nolte, S., Kwek, L.-C., Rodríguez-Lara, B. M., Szameit, A., & Christodoulides, D. N. (2013) · Physical Review A · doi:10.1103/physreva.87.012309 · Cited by 182
Colloquium : Atomic spin chains on surfaces
Choi, D.-J., Lorente, N., Wiebe, J., von Bergmann, K., Otte, A. F., & Heinrich, A. J. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.041001 · Cited by 181
Li, X., Ma, Y., Han, J., Chen, T., Xu, Y., Cai, W., Wang, H., Song, Y., Xue, Z., Yin, Z., et al. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.054009 · Cited by 181
Quantum-state transfer via the ferromagnetic chain in a spatially modulated field
Shi, T., Li, Y., Song, Z., & Sun, C.-P. (2005) · Physical Review A · doi:10.1103/physreva.71.032309 · Cited by 167
Quantum Computing and Communications
Imre, S., & Balázs, F. (2004) · Wiley eBooks · doi:10.1002/9780470869048 · Cited by 167
Spatial Search by Quantum Walk is Optimal for Almost all Graphs
Chakraborty, S., Novo, L., Ambainis, A., & Omar, Y. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.100501 · Cited by 164
Entanglement entropy in quantum impurity systems and systems with boundaries
Affleck, I. K., Laflorencie, N., & Sørensen, E. S. (2009) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/42/50/504009 · Cited by 163
Robust quantum state transfer via topological edge states in superconducting qubit chains
Mei, F., Chen, G., Tian, L., Zhu, S.-L., & Jia, S. (2018) · Physical Review A · doi:10.1103/physreva.98.012331 · Cited by 165
Perfect quantum state transfer with randomly coupled quantum chains
Burgarth, D. K., & Bose, S. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/135 · Cited by 152
Quantum Walks of Correlated Photon Pairs in Two-Dimensional Waveguide Arrays
Poulios, K., Keil, R., Fry, D., Meinecke, J. D. A., Matthews, J. C. F., Politi, A., Lobino, M., Gräfe, M., Heinrich, M., Nolte, S., et al. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.143604 · Cited by 148
Quantum walk and its application domains: A systematic review
Kadian, K., Garhwal, S., & Kumar, A. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100419 · Cited by 155
Perfect State Transfer on a Spin Chain without State Initialization
Franco, C. D., Paternostro, M., & Kim, M. S. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.230502 · Cited by 145
Information-capacity description of spin-chain correlations
Giovannetti, V., & Fazio, R. (2005) · Physical Review A · doi:10.1103/physreva.71.032314 · Cited by 157
Experimental perfect state transfer of an entangled photonic qubit
Chapman, R. J., Santandrea, M., Huang, Z., Corrielli, G., Crespi, A., Yung, M. H., Osellame, R., & Peruzzo, A. (2016) · Nature Communications · doi:10.1038/ncomms11339 · Cited by 148
Plenio, M. B., & Semião, F. L. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/073 · Cited by 140
Quantum-state transmission via a spin ladder as a robust data bus
Li, Y., Shi, T., Chen, B., Song, Z., & Sun, C.-P. (2005) · Physical Review A · doi:10.1103/physreva.71.022301 · Cited by 139
Perfect state transfer: Beyond nearest-neighbor couplings
Kay, A. (2006) · Physical Review A · doi:10.1103/physreva.73.032306 · Cited by 135
Quantum speed limit for perfect state transfer in one dimension
Yung, M.-H. (2006) · Physical Review A · doi:10.1103/physreva.74.030303 · Cited by 128
Communication at the quantum speed limit along a spin chain
Murphy, M., Montangero, S., Giovannetti, V., & Calarco, T. (2010) · Physical Review A · doi:10.1103/physreva.82.022318 · Cited by 121
Globally Controlled Quantum Wires for Perfect Qubit Transport, Mirroring, and Computing
Fitzsimons, J. F., & Twamley, J. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.090502 · Cited by 119
Perfect state transfer in long-range interacting spin chains
Gualdi, G., Kostak, V., Marzoli, I., & Tombesi, P. (2008) · Physical Review A · doi:10.1103/physreva.78.022325 · Cited by 121
Finite Speed of Quantum Scrambling with Long Range Interactions
Chen, C.-F., & Lucas, A. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.250605 · Cited by 113
From perfect to fractal transmission in spin chains
De Chiara, G., Rossini, D., Montangero, S., & Fazio, R. (2005) · Physical Review A · doi:10.1103/physreva.72.012323 · Cited by 113
Number-Theoretic Nature of Communication in Quantum Spin Systems
Godsil, C. D., Kirkland, S. J., Simone Severini, B., & Smith, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050502 · Cited by 111
Zhang, J., Long, G. L., Zhang, W., Deng, Z., Liu, W., & Lu, Z. (2005) · Physical Review A · doi:10.1103/physreva.72.012331 · Cited by 110
Fast escape of a quantum walker from an integrated photonic maze
Caruso, F., Crespi, A., Ciriolo, A. G., Sciarrino, F., & Osellame, R. (2016) · Nature Communications · doi:10.1038/ncomms11682 · Cited by 105
Simulations of Information Transport in Spin Chains
Cappellaro, P., Ramanathan, C., & Cory, D. G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.250506 · Cited by 103
Topologically protected quantum state transfer in a chiral spin liquid
Yao, N. Y., Laumann, C. R., Gorshkov, A. V., Weimer, H., Jiang, L., Cirac, J. I., Zoller, P., & Lukin, M. D. (2013) · Nature Communications · doi:10.1038/ncomms2531 · Cited by 104
Perfect State Transfer in Quantum Walks on Graphs
Kendon, V. M., & Tamon, C. (2011) · Journal of Computational and Theoretical Nanoscience · doi:10.1166/jctn.2011.1706 · Cited by 105
Strong-coupling ansatz for the one-dimensional Fermi gas in a harmonic potential
Levinsen, J., Massignan, P., Bruun, G. M., & Parish, M. M. (2015) · Science Advances · doi:10.1126/sciadv.1500197 · Cited by 99
Efficient generation of graph states for quantum computation
Clark, S. R., Alves, C. M., & Jaksch, D. (2005) · New Journal of Physics · doi:10.1088/1367-2630/7/1/124 · Cited by 97
Wang, D., Song, C., Feng, W., Cai, H., Xu, D., Deng, H., Li, H., Zheng, D., Zhu, X., Wang, H., et al. (2019) · Nature Physics · doi:10.1038/s41567-018-0400-9 · Cited by 96
Quantum spin transistor with a Heisenberg spin chain
Marchukov, O. V., Volosniev, A. G., Valiente, M., Petrosyan, D., & Zinner, N. T. (2016) · Nature Communications · doi:10.1038/ncomms13070 · Cited by 95
Solid-state quantum communication with Josephson arrays
Romito, A., Fazio, R., & Bruder, C. (2005) · Physical Review B · doi:10.1103/physrevb.71.100501 · Cited by 95
Engineering the dynamics of effective spin-chain models for strongly interacting atomic gases
Volosniev, A. G., Petrosyan, D., Valiente, M., Fedorov, D. V., Jensen, A. S., & Zinner, N. T. (2015) · Physical Review A · doi:10.1103/physreva.91.023620 · Cited by 96
99 % -fidelity ballistic quantum-state transfer through long uniform channels
Apollaro, T. J. G., Banchi, L., Cuccoli, A., Vaia, R., & Verrucchi, P. (2012) · Physical Review A · doi:10.1103/physreva.85.052319 · Cited by 94
PARAMETERS OF INTEGRAL CIRCULANT GRAPHS AND PERIODIC QUANTUM DYNAMICS
Saxena, N., Simone Severini, B., & Shparlinski, I. E. (2007) · International Journal of Quantum Information · doi:10.1142/s0219749907002918 · Cited by 93
Speed limits for quantum gates in multiqubit systems
Ashhab, S., de Groot, P. C., & Nori, F. (2012) · Physical Review A · doi:10.1103/physreva.85.052327 · Cited by 89
Hierarchical Construction of Higher-Order Exceptional Points
Zhong, Q., Kou, J.-L., Özdemir, Ş. K., & El‐Ganainy, R. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.203602 · Cited by 89
Hamiltonian Tomography in an Access-Limited Setting without State Initialization
Franco, C. D., Paternostro, M., & Kim, M. S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.187203 · Cited by 88
Robustness of spin-coupling distributions for perfect quantum state transfer
Zwick, A., Álvarez, G. A., Stolze, J., & Osenda, O. (2011) · Physical Review A · doi:10.1103/physreva.84.022311 · Cited by 87
Quantum networks on cubelike graphs
Bernasconi, A., Godsil, C. D., & Simone Severini, B. (2008) · Physical Review A · doi:10.1103/physreva.78.052320 · Cited by 87
Perfect Quantum Routing in Regular Spin Networks
Pemberton-Ross, P. J., & Kay, A. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.020503 · Cited by 84
Graph spectra in Computer Science
Cvetković, D., & Simić, S. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2010.11.035 · Cited by 84
Ahmadi, O., Alon, N., Blake, I. F., & Shparlinski, I. E. (2008) · Linear Algebra and its Applications · doi:10.1016/j.laa.2008.08.020 · Cited by 84
Separability and ground-state factorization in quantum spin systems
Giampaolo, S. M., Adesso, G., & Illuminati, F. (2009) · Physical Review B · doi:10.1103/physrevb.79.224434 · Cited by 86
Multiuser quantum communication networks
Wójcik, A., Łuczak, T., Kurzyński, P., Grudka, A., Gdala, T., & Bednarska, M. (2007) · Physical Review A · doi:10.1103/physreva.75.022330 · Cited by 83
Quantum-state transfer via resonant tunneling through local-field-induced barriers
Lorenzo, S., Apollaro, T. J. G., Sindona, A., & Plastina, F. (2013) · Physical Review A · doi:10.1103/physreva.87.042313 · Cited by 81
Perfect transfer of path-entangled photons in Jx photonic lattices
Pérez-Leija, A., Keil, R., Moya-Cessa, H. M., Szameit, A., & Christodoulides, D. N. (2013) · Physical Review A · doi:10.1103/physreva.87.022303 · Cited by 83
Wen, X., Ryu, S., & Ludwig, A. W. W. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.235119 · Cited by 87
Routing quantum information in spin chains
Paganelli, S., Lorenzo, S., Apollaro, T. J. G., Plastina, F., & Giorgi, G. L. (2013) · Physical Review A · doi:10.1103/physreva.87.062309 · Cited by 80
Improved Transfer of Quantum Information Using a Local Memory
Giovannetti, V., & Burgarth, D. K. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.030501 · Cited by 79
Unifying Quantum State Transfer and State Amplification
Kay, A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.010501 · Cited by 77
Optimal quantum-chain communication by end gates
Burgarth, D. K., Giovannetti, V., & Bose, S. (2007) · Physical Review A · doi:10.1103/physreva.75.062327 · Cited by 76
Perfect state transfer in networks of arbitrary topology and coupling configuration
Kostak, V., Nikolopoulos, G. M., & Jex, I. (2007) · Physical Review A · doi:10.1103/physreva.75.042319 · Cited by 75
Quantum walks on quotient graphs
Krovi, H., & Brun, T. A. (2007) · Physical Review A · doi:10.1103/physreva.75.062332 · Cited by 82
Sørensen, E. S., Chang, M.-S., Laflorencie, N., & Affleck, I. K. (2007) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2007/08/p08003 · Cited by 77
Optimal state encoding for quantum walks and quantum communication over spin systems
Haselgrove, H. L. (2005) · Physical Review A · doi:10.1103/physreva.72.062326 · Cited by 75
Integrated photonic quantum walks
Gräfe, M., Heilmann, R., Lebugle, M., Guzman-Silva, D., Perez-Leija, A., & Szameit, A. (2016) · Journal of Optics · doi:10.1088/2040-8978/18/10/103002 · Cited by 70
State transfer in static and dynamic spin chains with disorder
Petrosyan, D., Nikolopoulos, G. M., & Lambropoulos, P. (2010) · Physical Review A · doi:10.1103/physreva.81.042307 · Cited by 74
Discrete-time quantum walk approach to state transfer
Kurzyński, P., & Wójcik, A. (2011) · Physical Review A · doi:10.1103/physreva.83.062315 · Cited by 75
Perfect state transfer and efficient quantum routing: A discrete-time quantum-walk approach
Zhan, X., Qin, H., Bian, Z., Li, J., & Xue, P. (2014) · Physical Review A · doi:10.1103/physreva.90.012331 · Cited by 74
Basics of perfect communication through quantum networks
Kay, A. (2011) · Physical Review A · doi:10.1103/physreva.84.022337 · Cited by 72
Automatic spin-chain learning to explore the quantum speed limit
Zhang, X., Cui, Z.-W., Wang, X., & Yung, M. (2018) · Physical Review A · doi:10.1103/physreva.97.052333 · Cited by 75
Quantum router based on ac control of qubit chains
Zueco, D., Galve, F., Kohler, S., & Peter Hänggi, A. (2009) · Physical Review A · doi:10.1103/physreva.80.042303 · Cited by 71
Photonic simulation of entanglement growth and engineering after a spin chain quench
Pitsios, I., Banchi, L., Rab, A. S., Bentivegna, M., Caprara, D., Crespi, A., Spagnolo, N., Bose, S., Mataloni, P., Osellame, R., et al. (2017) · Nature Communications · doi:10.1038/s41467-017-01589-y · Cited by 56
Multipartite entanglement in quantum spin chains
Bruß, D., Datta, N., EKERT, A. K., Kwek, L. C., & Macchiavello, C. (2005) · Physical Review A · doi:10.1103/physreva.72.014301 · Cited by 72
Self-citationFast Quantum State Transfer and Entanglement Renormalization Using Long-Range Interactions
Eldredge, Z., Gong, Z., Young, J. T., Moosavian, A. H., Foss‐Feig, M., & Gorshkov, A. V. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.170503 · Cited by 70
Fast and robust quantum state transfer via a topological chain
Palaiodimopoulos, N. E., Brouzos, I., Diakonos, F. Κ., & Theocharis, G. (2021) · Physical Review A · doi:10.1103/physreva.103.052409 · Cited by 69
Characterization of quantum circulant networks having perfect state transfer
Bašić, M. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0381-z · Cited by 68
Quantum-state transfer in staggered coupled-cavity arrays
Almeida, G. M. A., Ciccarello, F., Apollaro, T. J. G., & Souza, A. M. C. (2016) · Physical Review A · doi:10.1103/physreva.93.032310 · Cited by 70
Zwick, A., Álvarez, G. A., Stolze, J., & Osenda, O. (2012) · Physical Review A · doi:10.1103/physreva.85.012318 · Cited by 68
Criticality and factorization in the Heisenberg chain with Dzyaloshinskii-Moriya interaction
Yi, T.-C., You, W., Wu, N., & Oleś, A. M. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.024423 · Cited by 68
Perfect state transfer on distance-regular graphs and association schemes
Coutinho, G., Godsil, C. D., Guo, K., & Vanhove, F. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2015.03.024 · Cited by 72
Superconducting Quantum Circuits, Qubits and ComputingPreprint
Wendin, G. P., & Shumeiko, V. S. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.cond-mat/0508729 · Cited by 87
Quantum cloning in spin networks
Chiara, G. D., Fazio, R., Macchiavello, C., Montangero, S., & Palma, G. M. (2004) · Physical Review A · doi:10.1103/physreva.70.062308 · Cited by 66
Landau–Zener Topological Quantum State Transfer
Longhi, S., Giorgi, G. L., & Zambrini, R. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201800090 · Cited by 65
Perfect state transfer in integral circulant graphs
Bašić, M., Petković, M. D., & Stevanović, D. (2009) · Applied Mathematics Letters · doi:10.1016/j.aml.2008.11.005 · Cited by 64
Quantum-state transfer in imperfect artificial spin networks
Paternostro, M., Palma, G. M., Kim, M. S., & Falci, G. (2005) · Physical Review A · doi:10.1103/physreva.71.042311 · Cited by 67
High-order exceptional points in supersymmetric arrays
Zhang, S. M., Zhang, X. Z., Jin, L., & Song, Z. (2020) · Physical Review A · doi:10.1103/physreva.101.033820 · Cited by 63
Metadata
- Authors
- Christandl, M., Datta, N., Ekert, A., & Landahl, A. J.
- Affiliations
- University of Cambridge (GB)
- National University of Singapore (SG)
- Hewlett-Packard (United States) (US)
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2004-05-04
- Volume
- 92
- Issue
- 18
- Pages
- 187902-187902
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2028212109
- Semantic Scholar
- eb739158478cb8205c1ed010d906ee69335abf55
- Cited by
- 1,179
- References
- 22
- Citations by year
- 2026: 48 · 2025: 67 · 2024: 45 · 2023: 57 · 2022: 60 · 2021: 54 · 2020: 57 · 2019: 62 · 2018: 48 · 2017: 47 · 2016: 56 · 2015: 50 · 2014: 54 · 2013: 53 · 2012: 54
- FWCI
- 50.92
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review Letters (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- National University of Singapore (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- perfect state transfer, quantum spin networks, qubit networks, linear chains, quantum communication, quantum computing, qubit coupling, communication distance
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.
A language model drew the claims from the paper on 2026-10-06, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-06 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
