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
0 of 4 cited sources checked · 0 supported · 0 flagged
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 .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes- 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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'.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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 .”
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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 .”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesThe 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”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passes
- 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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 .”
Strength:plain· not yet calibratedCausal:correlational· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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.”
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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 .”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.”
Strength:hedged· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✗ Based: failsProbably 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
Tests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesIt 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.”
Strength:plain· not yet calibratedCausal:direct· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes? Load-bearing: unclear✓ Based: passesIt 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
Load-bearingStrength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✓ Load-bearing: passes✓ Based: passesProbably 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.”
Strength:plain· not yet calibratedTests✓ Asserted: passes✓ Checkable: passes✗ Load-bearing: fails✓ Based: passesProbably 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.
Claimed chain communication distance counts vertices instead of edges
MinorThe proposed chain has N qubits with its endpoints at opposite ends, so their shortest path has N−1 edges. Under the paper's definition of distance, its perfect communication distance is N−1, not N.
“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.”
“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
Flagged first, then by citations
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
Items 201–300 of 1,001
Practicality of Spin Chain Wiring in Diamond Quantum Technologies
Ping, Y., Lovett, B. W., Benjamin, S. C., & Gauger, E. M. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.100503 · Cited by 36
Hamiltonian simulation with nearly optimal dependence on spectral norm
Low, G. H. (2019) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3313276.3316386 · Cited by 35
Robust single-qubit gates by composite pulses in three-level systems
Shi, Z., Wu, H.-N., Shen, L.-T., Song, J., Xia, Y., Yi, X. X., & Zheng, S.-B. (2021) · Physical Review A · doi:10.1103/physreva.103.052612 · Cited by 35
Arbitrary entangled state transfer via a topological qubit chain
Wang, C., Li, L., Gong, J., & Liu, Y.-X. (2022) · Physical Review A · doi:10.1103/physreva.106.052411 · Cited by 35
Tian, T., Zhang, Y., Zhang, L., Wu, L., Lin, S., Zhou, J., Duan, C., Jiang, J., & Du, J. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.215901 · Cited by 35
Robust state transfer with high fidelity in spin-1/2 chains by Lyapunov control
Shi, Z., Zhao, X., & Yi, X. X. (2015) · Physical Review A · doi:10.1103/physreva.91.032301 · Cited by 35
Localization effects induced by decoherence in superpositions of many-spin quantum states
Álvarez, G. A., & Suter, D. (2011) · Physical Review A · doi:10.1103/physreva.84.012320 · Cited by 35
State transfer in dissipative and dephasing environments
Hu, M. (2010) · The European Physical Journal D · doi:10.1140/epjd/e2010-00183-7 · Cited by 35
Quantum-information processing with noisy cluster states
Tame, M., Paternostro, M., Kim, M. S., & Vedral, V. (2005) · Physical Review A · doi:10.1103/physreva.72.012319 · Cited by 35
Quantum State Transfer in Graphs
Coutinho, G. (2014) · UWSpace (University of Waterloo) · Cited by 35
Processor Core Model for Quantum Computing
Yung, M.-H., Benjamin, S. C., & Bose, S. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.220501 · Cited by 34
Arbitrary perfect state transfer in d -level spin chains
Bayat, A. (2014) · Physical Review A · doi:10.1103/physreva.89.062302 · Cited by 34
Qubit state transfer via discrete-time quantum walks
Yalçınkaya, İ., & Gedik, Z. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/22/225302 · Cited by 35
Analytic next-to-nearest-neighbor XX models with perfect state transfer and fractional revival
Christandl, M., Vinet, L., & Zhedanov, A. S. (2017) · Physical Review A · doi:10.1103/physreva.96.032335 · Cited by 37
Self-citationTang, B., Li, G.-L., & Fu, M. (2016) · Journal of Magnetism and Magnetic Materials · doi:10.1016/j.jmmm.2016.11.116 · Cited by 34
Directional quantum state transfer in a dissipative Rydberg-atom-cavity system
Li, D., & Shao, X. (2019) · Physical Review A · doi:10.1103/physreva.99.032348 · Cited by 34
Spatio-Temporal Steering for Testing Nonclassical Correlations in Quantum Networks
Chen, S.-L., Lambert, N., Li, C.-M., Chen, G.-Y., Chen, Y.-N., Miranowicz, A., & Nori, F. (2017) · Scientific Reports · doi:10.1038/s41598-017-03789-4 · Cited by 35
Perfect state transfer on abelian Cayley graphs
Tan, Y.-Y., Feng, K., & Cao, X. (2018) · Linear Algebra and its Applications · doi:10.1016/j.laa.2018.11.011 · Cited by 36
Observation of topological pumping of a defect state in a Fock photonic lattice
Wu, C., Liu, W., Jia, Y., Chen, G., & Chen, F. (2023) · Physical Review A · doi:10.1103/physreva.107.033501 · Cited by 35
Kuznetsova, E. I., & Fel’dman, E. B. (2006) · Journal of Experimental and Theoretical Physics · doi:10.1134/s1063776106060021 · Cited by 34
Quantum interference enables constant-time quantum information processing
Stobińska, M., Buraczewski, A., Moore, M., Clements, W. R., Renema, J. J., Nam, S. W., Gerrits, T., Lita, A., Kolthammer, W. S., Eckstein, A., et al. (2019) · Science Advances · doi:10.1126/sciadv.aau9674 · Cited by 34
Universal existence of exact quantum state transmissions in interacting media
Wu, L.-A., Liu, Y.-X., & Nori, F. (2009) · Physical Review A · doi:10.1103/physreva.80.042315 · Cited by 34
Quantum-state transfer in spin chains via isolated resonance of terminal spins
Korzekwa, K., Machnikowski, P., & Horodecki, P. (2014) · Physical Review A · doi:10.1103/physreva.89.062301 · Cited by 35
Perfect quantum state transfer in two- and three-dimensional structures
Karimipour, V., Rad, M. S., & Asoudeh, M. (2012) · Physical Review A · doi:10.1103/physreva.85.010302 · Cited by 33
Perfect state transfer on quotient graphs
Bachman, R. E., Fredette, E., Fuller, J., Landry, M. P., Opperman, M., Tamon, C., & Tollefson, A. (2012) · Quantum Information and Computation · doi:10.26421/qic12.3-4-9 · Cited by 39
Effect of perturbations on information transfer in spin chains
Ronke, R., Spiller, T. P., & D’Amico, I. (2011) · Physical Review A · doi:10.1103/physreva.83.012325 · Cited by 33
Perfect state transfers by selective quantum interferences within complex spin networks
Álvarez, G. A., Mishkovsky, M., Danieli, E. P., Levstein, P. R., Pastawski, H. M., & Frydman, L. (2010) · Physical Review A · doi:10.1103/physreva.81.060302 · Cited by 33
Coherent time evolution and boundary conditions of two-photon quantum walks in waveguide arrays
Meinecke, J. D. A., Poulios, K., Politi, A., Matthews, J. C. F., Peruzzo, A., Ismail, N., Wörhoff, K., O’Brien, J. L., & Thompson, M. G. (2013) · Physical Review A · doi:10.1103/physreva.88.012308 · Cited by 32
All possible coupling schemes in XY spin chains for perfect state transfer
Wang, Y., Shuang, F., & RABITZ, H. A. (2011) · Physical Review A · doi:10.1103/physreva.84.012307 · Cited by 32
Pretty good state transfer of entangled states through quantum spin chains
Sousa, R., & Omar, Y. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/12/123003 · Cited by 32
Perfect wave-packet splitting and reconstruction in a one-dimensional lattice
Banchi, L., Compagno, E., & Bose, S. (2015) · Physical Review A · doi:10.1103/physreva.91.052323 · Cited by 33
EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
Berry, D. W., Childs, A. M., Cleve, R., Kothari, R., & Somma, R. D. (2017) · Forum of Mathematics Sigma · doi:10.1017/fms.2017.2 · Cited by 39
He, Z., Yao, C., & Zou, J. (2013) · Physical Review A · doi:10.1103/physreva.88.044304 · Cited by 32
Nested entangled states for distributed quantum channels
Franco, C. D., Paternostro, M., & Kim, M. S. (2008) · Physical Review A · doi:10.1103/physreva.77.020303 · Cited by 32
Spatial entanglement using a quantum walk on a many-body system
Goyal, S. K., & Chandrashekar, C. M. (2010) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/43/23/235303 · Cited by 34
Graph spectral techniques in computer sciences
Arsić, B., Cvetković, D., Simić, S., & Skaric, M. (2011) · Applicable Analysis and Discrete Mathematics · doi:10.2298/aadm111223025a · Cited by 31
Quantum Network Transfer and Storage with Compact Localized States Induced by Local Symmetries
Röntgen, M., Morfonios, C. V., Brouzos, I., Diakonos, F. Κ., & Schmelcher, P. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.080504 · Cited by 31
Disorder-assisted distribution of entanglement in XY spin chains
Almeida, G. M. A., de Moura, F. A. B. F., Apollaro, T. J. G., & Lyra, M. L. (2017) · Physical Review A · doi:10.1103/physreva.96.032315 · Cited by 30
Quantum Transport of Rydberg Excitons with Synthetic Spin-Exchange Interactions
Yang, F., Yang, S., & You, L. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.063001 · Cited by 30
Perfect quantum state transfer on diamond fractal graphs
Derevyagin, M., Dunne, G. V., Mograby, G., & Teplyaev, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02828-w · Cited by 30
An infinite family of circulant graphs with perfect state transfer in discrete quantum walks
Zhan, H. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2483-3 · Cited by 33
Srinivasa, V., Levy, J., & Hellberg, C. S. (2007) · Physical Review B · doi:10.1103/physrevb.76.094411 · Cited by 31
Atomistic simulations of adiabatic coherent electron transport in triple donor systems
Rahman, R., Park, S. H., Cole, J. H., Greentree, A. D., Muller, R. P., Klimeck, G., & Hollenberg, L. C. L. (2009) · Physical Review B · doi:10.1103/physrevb.80.035302 · Cited by 30
Iterative quantum-state transfer along a chain of nuclear spin qubits
Zhang, J., Rajendran, N., Peng, X., & Suter, D. (2007) · Physical Review A · doi:10.1103/physreva.76.012317 · Cited by 30
Pretty good quantum state transfer in symmetric spin networks via magnetic field
Kempton, M., Lippner, G., & Yau, S. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1658-z · Cited by 30
PERFECT STATE TRANSFER, GRAPH PRODUCTS AND EQUITABLE PARTITIONS
Yang, G., Greenberg, B., Perez, O., & Tamon, C. (2011) · International Journal of Quantum Information · doi:10.1142/s0219749911007472 · Cited by 34
Zhang, J., Peng, X., & Suter, D. (2006) · Physical Review A · doi:10.1103/physreva.73.062325 · Cited by 30
Quantum Cayley networks of the hypercube
Facer, C., Twamley, J., & Cresser, J. D. (2008) · Physical Review A · doi:10.1103/physreva.77.012334 · Cited by 30
Chiral Quantum Optics in the Bulk of Photonic Quantum Hall Systems
Bernardis, D. D., Piccioli, F. S., Rabl, P., & Carusotto, I. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030306 · Cited by 29
Quantum-state transfer through long-range correlated disordered channels
Almeida, G. M. A., de Moura, F. A. B. F., & Lyra, M. L. (2018) · Physics Letters A · doi:10.1016/j.physleta.2018.03.028 · Cited by 29
Spin chains for two-qubit teleportation
Apollaro, T. J. G., Almeida, G. M. A., Lorenzo, S., Ferraro, A., & Paganelli, S. (2019) · Physical Review A · doi:10.1103/physreva.100.052308 · Cited by 29
Quantum communication through a spin ring with twisted boundary conditions
Bose, S., Jin, B.-Q., & Korepin, V. E. (2005) · Physical Review A · doi:10.1103/physreva.72.022345 · Cited by 30
Quantum-state transfer characterized by mode entanglement
Qian, X., Li, Y., Li, Y., Song, Z., & Sun, C. P. (2005) · Physical Review A · doi:10.1103/physreva.72.062329 · Cited by 29
Freezing distributed entanglement in spin chains
D’Amico, I., Lovett, B. W., & Spiller, T. P. (2007) · Physical Review A · doi:10.1103/physreva.76.030302 · Cited by 29
Controlled quantum-state transfer in a spin chain
Gong, J., & Brumer, P. W. (2007) · Physical Review A · doi:10.1103/physreva.75.032331 · Cited by 29
Integrated photonic quantum walks
Gräfe, M., & Szameit, A. (2020) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/ab6cfc · Cited by 28
Enhanced quantum state transfer by circumventing quantum chaotic behavior
Xiang, L., Chen, J., Zhu, Z., Song, Z., Bao, Z., Zhu, X., Jin, F., Wang, K., Xu, S., Zou, Y., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-48791-3 · Cited by 32
Perfect state transfer on Cayley graphs over dihedral groups
Cao, X., & Feng, K. (2019) · Linear and Multilinear Algebra · doi:10.1080/03081087.2019.1599805 · Cited by 29
Further results on the perfect state transfer in integral circulant graphs
Petković, M. D., & Bašić, M. (2010) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2010.11.005 · Cited by 28
Franco, C. D., Paternostro, M., Tsomokos, D. I., & Huelga, S. F. (2008) · Physical Review A · doi:10.1103/physreva.77.062337 · Cited by 28
Many-body quantum interference on hypercubes
Dittel, C., Keil, R., & Weihs, G. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa540c · Cited by 27
Creation and transfer of nonclassical states of motion using Rydberg dressing of atoms in a lattice
Buchmann, L. F., Mølmer, K., & Petrosyan, D. (2017) · Physical Review A · doi:10.1103/physreva.95.013403 · Cited by 27
Enhancing nonlocal advantage of quantum coherence in correlated quantum channels
Xie, Y.-X., & Qin, Z.-Y. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02870-8 · Cited by 27
Coherent ground-state transport of neutral atoms
Li, X. X., You, J.-B., Shao, X., & Li, W. (2022) · Physical Review A · doi:10.1103/physreva.105.032417 · Cited by 27
Many-qubit quantum state transfer via spin chains
Apollaro, T. J. G., Lorenzo, S., Sindona, A., Paganelli, S., Giorgi, G. L., & Plastina, F. (2015) · Physica Scripta · doi:10.1088/0031-8949/2015/t165/014036 · Cited by 27
NMR Quantum Information Processing
Lu, D., Brodutch, A., Park, J., Katiyar, H., Jochym-O’Connor, T., & Laflamme, R. (2016) · Biological magnetic resonance · doi:10.1007/978-1-4939-3658-8_7 · Cited by 29
High-probability state transfer in spin- 1/2 chains: Analytical and numerical approaches
Fel’dman, E. B., Kuznetsova, E. I., & Zenchuk, A. I. (2010) · Physical Review A · doi:10.1103/physreva.82.022332 · Cited by 27
Perfect state transfer in products and covers of graphs
Coutinho, G., & Godsil, C. D. (2015) · Linear and Multilinear Algebra · doi:10.1080/03081087.2015.1033381 · Cited by 27
Laplacian state transfer in coronas
Ackelsberg, E., Brehm, Z., Chan, A., Mundinger, J., & Tamon, C. (2016) · Linear Algebra and its Applications · doi:10.1016/j.laa.2016.05.018 · Cited by 27
Exact dimension estimation of interacting qubit systems assisted by a single quantum probe
Sone, A., & Cappellaro, P. (2017) · Physical Review A · doi:10.1103/physreva.96.062334 · Cited by 27
Tripartite states Bell-nonlocality sudden death with intrinsic decoherence
Ben-Qiong, L., Shao, B., & Zou, J. (2010) · Physics Letters A · doi:10.1016/j.physleta.2010.03.003 · Cited by 27
Superballistic diffusion of entanglement in disordered spin chains
Fitzsimons, J. F., & Twamley, J. (2005) · Physical Review A · doi:10.1103/physreva.72.050301 · Cited by 27
Universal state transfer on graphs
Cameron, S., Fehrenbach, S., Granger, L., Hennigh, O., Shrestha, S., & Tamon, C. (2014) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.05.004 · Cited by 26
Fock-state-lattice approach to quantum optics
Saugmann, P. M., & Larson, J. (2023) · Physical Review A · doi:10.1103/physreva.108.033721 · Cited by 26
Information-flux approach to multiple-spin dynamics
Franco, C. D., Paternostro, M., Palma, G. M., & Kim, M. S. (2007) · Physical Review A · doi:10.1103/physreva.76.042316 · Cited by 26
Perfect quantum state transfer using Hadamard diagonalizable graphs
Johnston, N., Kirkland, S., Plosker, S., Storey, R., & Zhang, X. (2017) · Linear Algebra and its Applications · doi:10.1016/j.laa.2017.05.037 · Cited by 26
Teleportation of entanglement using a three-particle entangled W state
Gao, X., Zhang, Z., Gong, Y.-X., Sheng, B., & Yu, X. (2016) · Journal of the Optical Society of America B · doi:10.1364/josab.34.000142 · Cited by 26
Networks of dissipative quantum harmonic oscillators: A general treatment
de Ponte, M. A., Mizrahi, S. S., & Moussa, M. H. Y. (2007) · Physical Review A · doi:10.1103/physreva.76.032101 · Cited by 26
Entanglement properties in mixed-spin Heisenberg systems
Sun, Z., Wang, X., Hu, A., & Li, Y. (2006) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.03.020 · Cited by 26
Cloning transformations in spin networks without external control
Chiara, G. D., Fazio, R., Macchiavello, C., Montangero, S., & Palma, G. M. (2005) · Physical Review A · doi:10.1103/physreva.72.012328 · Cited by 28
Efficient algorithms in quantum query complexity
Kothari, R. (2014) · UWSpace (University of Waterloo) · Cited by 26
Introduction to Quantum Cryptography
Tan, X. (2013) · InTech eBooks · doi:10.5772/56092 · Cited by 25
Faithful state transfer through a quantum channel
Paganelli, S., PASQUALE, F. D., & Giorgi, G. L. (2006) · Physical Review A · doi:10.1103/physreva.74.012316 · Cited by 25
Fractional revivals of the quantum state in a tight-binding chain
Chen, B., Song, Z., & Sun, C. P. (2007) · Physical Review A · doi:10.1103/physreva.75.012113 · Cited by 25
Long-Range Quantum Gates using Dipolar Crystals
Weimer, H., Yao, N. Y., Laumann, C. R., & Lukin, M. D. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.100501 · Cited by 28
Time independent universal computing with spin chains: quantum plinko machine
Thompson, K. F., Gokler, C., Lloyd, S., & Shor, P. W. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/7/073044 · Cited by 27
Loft, N. J. S., Marchukov, O. V., Petrosyan, D., & Zinner, N. T. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/4/045011 · Cited by 25
Zheng, L.-N., Qi, L., Cheng, L., Wang, H., & Zhang, S. (2020) · Physical Review A · doi:10.1103/physreva.102.012606 · Cited by 25
Spin chains with electrons in Penning traps
Ciaramicoli, G., Marzoli, I., & Tombesi, P. (2007) · Physical Review A · doi:10.1103/physreva.75.032348 · Cited by 25
QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
Angeles-Canul, R. J., Norton, R. M., Opperman, M., PARIBELLO, C. C., Russell, M. C., & Tamon, C. (2009) · International Journal of Quantum Information · doi:10.1142/s0219749909006103 · Cited by 26
Robust and reliable transfer of a qubit state through an XY spin chain
Wang, Z.-M., Bishop, C. A., Byrd, M., Shao, B., & Zou, J. (2009) · Physical Review A · doi:10.1103/physreva.80.022330 · Cited by 25
Nonequilibrium Reliability of Quantum Memories
Kay, A. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.070503 · Cited by 25
Perturbative many-body transfer
Chetcuti, W. J., Sanavio, C., Lorenzo, S., & Apollaro, T. J. G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab7a33 · Cited by 24
Perspective on new implementations of atomtronic circuits
Polo, J., Chetcuti, W. J., Domanti, E. C., Kitson, P. J., Osterloh, A., Perciavalle, F., Singh, V. P., & Luigi Amico, A. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad48b2 · Cited by 26
Entanglement Transfer through an Antiferromagnetic Spin Chain
Bayat, A., & Bose, S. (2009) · Advances in Mathematical Physics · doi:10.1155/2010/127182 · Cited by 24
PERFECT STATE TRANSFER IN XX CHAINS INDUCED BY BOUNDARY MAGNETIC FIELDS
Linneweber, T., Stolze, J., & Uhrig, G. S. (2012) · International Journal of Quantum Information · doi:10.1142/s0219749912500293 · Cited by 24
Quantum error correction for state transfer in noisy spin chains
Kay, A. (2016) · Physical Review A · doi:10.1103/physreva.93.042320 · Cited by 24
Optimal control of fast and high-fidelity quantum state transfer in spin-1/2 chains
Zhang, X.-P., Shao, B., Hu, S., Zou, J., & Wu, L.-A. (2016) · Annals of Physics · doi:10.1016/j.aop.2016.10.020 · Cited by 24
Perfect state transfer on gcd-graphs
Pal, H., & Bhattacharjya, B. (2016) · Linear and Multilinear Algebra · doi:10.1080/03081087.2016.1267105 · Cited by 24
Nonadiabatic robust excitation transfer assisted by an imaginary gauge field
Longhi, S. (2017) · Physical Review A · doi:10.1103/physreva.95.062122 · Cited by 24
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
