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 901–1,000 of 1,001
Adiabatic state distribution using anti-ferromagnetic spin systems
Groenland, K. (2019) · SciPost Physics · doi:10.21468/scipostphys.6.1.011 · Cited by 2
Nested multilevel entanglement in Matryoshka states
Majumdar, M. G. (2021) · Pramana · doi:10.1007/s12043-021-02213-x · Cited by 2
Signless Laplacian state transfer on Q -graphs
Zhang, X., Cui, S., & Tian, G. (2022) · Applied Mathematics and Computation · doi:10.1016/j.amc.2022.127070 · Cited by 2
Optimally Controlled Non-Adiabatic Quantum State Transmission in the Presence of Quantum Noise
Liang, X.-H., Wu, L.-A., & Wang, Z.-M. (2023) · Photonics · doi:10.3390/photonics10030274 · Cited by 2
Mouloudakis, G., Stergou, I., & Lambropoulos, P. (2023) · Physica Scripta · doi:10.1088/1402-4896/ace0de · Cited by 2
Spin and electronic excitations in 4f atomic chains on Au(111) substrates
Facemyer, D. W., Dandu, N. K., Lee, A. T., Singh, V., Ngo, A. T., & Ulloa, S. E. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.085407 · Cited by 2
Planar and tunable quantum state transfer in a splicing Y-junction Su–Schrieffer–Heeger chain
Zheng, L.-N., Wang, H., & Yi, X. X. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ad05ea · Cited by 2
Pulse‐Level Quantum Robust Control with Diffusion‐Based Reinforcement Learning
Zhang, Y., Shang, T., Zhang, C., & Guo, X. (2025) · Advanced Physics Research · doi:10.1002/apxr.202400159 · Cited by 2
High-fidelity transfer of entangled states on a quantum turntable
Ymai, L. H., Wilsmann, K. W., Tonel, A. P., Foerster, A., & Links, J. (2025) · Newton · doi:10.1016/j.newton.2025.100226 · Cited by 2
Perfect State Transfer Between Real Pure States
Godsil, C. D., Kirkland, S., & Monterde, H. (2025) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/25m1734075 · Cited by 2
Perfect Wave Transfer in Continuous Quantum Systems
Moosavi, P., Christandl, M., Graf, G. M., & Sotiriadis, S. (2025) · Physical Review Letters · doi:10.1103/k46y-d2k1 · Cited by 2
Self-citationBypassing State Initialisation in Perfect State Transfer Protocols on Spin-Chains
Franco, C. D., Paternostro, M., & Kim, M. S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-18073-6_14 · Cited by 2
Longhi, S. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.03.010 · Cited by 2
Co-evolution of networks and quantum dynamics: a generalization of preferential attachment
Nicosia, V., Machida, T., Wilson, R. C., Hancock, E. R., Konno, N., Latora, V., & Simone Severini, B. (2013) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2013/08/p08016 · Cited by 2
D’Amico, I., Lovett, B. W., & Spiller, T. P. (2008) · Journal of Magnetism and Magnetic Materials · doi:10.1016/j.jmmm.2008.03.018 · Cited by 2
Effects of Intrinsic Decoherence on Information Transport in a Spin Chain
Zeng, T.-H., Bin, S., & Jian, Z. (2009) · Chinese Physics Letters · doi:10.1088/0256-307x/26/2/020313 · Cited by 2
Estimation and initialization of quantum network via continuous measurement on single node
Kato, Y., & Yamamoto, N. (2013) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2013.6760160 · Cited by 3
Entanglement transfer via two arrays of coupled resonator waveguides
Zhang, Y.-Q., & Jingbo, X. (2012) · Chinese Physics B · doi:10.1088/1674-1056/21/1/010304 · Cited by 2
Characteristics of Entanglement Wave in Two Parallel Spin Chains
Li, X., Li, Z.-F., Shi, Z.-L., & Wang, X. (2014) · Chinese Physics Letters · doi:10.1088/0256-307x/31/6/060301 · Cited by 2
Bounds on probability of state transfer with respect to readout time and edge weight
Gordon, W., Kirkland, S., Li, C.-K., Plosker, S., & Zhang, X. (2016) · Physical Review A · doi:10.1103/physreva.93.022309 · Cited by 2
On the diameter of integral circulant graphs.
Stevanović, D., Petković, M. D., & Bašić, M. (2012) · Ars Combinatoria · Cited by 2
Limitations of discrete-time quantum walk on a one-dimensional infinite chain
Lin, J.-Y., Zhu, X., & Wu, S. (2018) · Physics Letters A · doi:10.1016/j.physleta.2018.01.035 · Cited by 2
Sur, S., & Subrahmanyam, V. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aae952 · Cited by 2
Creating and preserving multi‐partite entanglement with spin chains
D’Amico, I., Lovett, B. W., & Spiller, T. P. (2008) · Physica status solidi. C, Conferences and critical reviews/Physica status solidi. C, Current topics in solid state physics · doi:10.1002/pssc.200777631 · Cited by 2
Translating Concepts of State Transfer to Spin-1 Chains
Wieśniak, M., Dutta, A., & Ryu, J. (2015) · Acta Physica Polonica A · doi:10.12693/aphyspola.128.3 · Cited by 2
Comparison of entangling protocols in ABC-type spin chains
Estarellas, M. P., Spiller, T. P., & D’Amico, I. (2020) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1638/1/012013 · Cited by 2
Research on controlling the perfect transfer of the two-qubit quantum information in spin chain
Wang, Q.-L., Ren, H.-F., & Wang, P. (2021) · Indian Journal of Physics · doi:10.1007/s12648-020-01949-3 · Cited by 2
Dynamical decoupling and NNN discrete quantum networks
Hoskovec, A., & Jex, I. (2022) · International Journal of Quantum Information · doi:10.1142/s0219749922500095 · Cited by 2
Currents in nonequilibrium steady states of open inhomogeneous X X spin chains
Bernard, P.-A., Bussière, I., Roberto Floreanini, B., & Vinet, L. (2025) · Physical Review A · doi:10.1103/physreva.111.022208 · Cited by 2
Quantum pair state transfer on isomorphic branches
Pal, H., & Mohapatra, S. (2026) · Linear Algebra and its Applications · doi:10.1016/j.laa.2026.03.026 · Cited by 7
Preparation of n -Atom GHZ State and Implementation of Quantum-State Transfer via Cavity Decay
Li-Bo, C., Qian-Hua, D., Gong-Wei, L., Chen, Z., & Lin, X. (2008) · Communications in Theoretical Physics · doi:10.1088/0253-6102/49/3/29 · Cited by 2
DYNAMICS OF PAIRWISE ENTANGLEMENT IN THE THREE-QUBIT HEISENBERG XX SPIN CHAIN
WU, E., & Zhang, X. (2009) · International Journal of Quantum Information · doi:10.1142/s0219749909005985 · Cited by 2
On the number of integral graphs
Costello, K., & Williams, P. (2015) · Linear Algebra and its Applications · doi:10.1016/j.laa.2015.11.027 · Cited by 2
Laplacian integrality in P 4 -sparse and P 4 -extendible graphs
Del-Vecchio, R. R., & Jones, Á. A. (2018) · Applied Mathematics and Computation · doi:10.1016/j.amc.2018.02.046 · Cited by 2
Measurement enhances long-distance entanglement generation in spin chains with dissipative processes
Rafiee, M. (2018) · The European Physical Journal D · doi:10.1140/epjd/e2018-90297-1 · Cited by 2
Efficient Transport in Closed Systems
Walschaers, M. (2018) · Springer theses · doi:10.1007/978-3-319-93151-7_4 · Cited by 2
Perfect Quantum State Transfer in Glauber-Fock Cavity Array
Meher, N. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04314-1 · Cited by 2
Optimal Dense Coding in a Two-qubit Heisenberg XXZ Model with Decoherence
Li, Y., Zhao, X. Q., Jia, X.-F., & Yang, G.-H. (2020) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04316-z · Cited by 2
Wang, Z.-M., Luo, D.-W., Li, B., & Wu, L.-A. (2020) · Physical Review A · doi:10.1103/physreva.101.042130 · Cited by 2
State transfer on two-fold Cayley trees via quantum walks*
Xue, X., & Ruan, Y. (2020) · Chinese Physics B · doi:10.1088/1674-1056/abcfa1 · Cited by 2
Xie, Y.-X., & Xu, X. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03190-1 · Cited by 2
Change-over switch for quantum states transfer with topological channels in a circuit-QED lattice
Cheng, L., Zheng, L.-N., Wu, R., Wang, H., & Zhang, S. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac2f2e · Cited by 3
Noise-reducing encoding strategies for spin chains
Keele, C., & Kay, A. (2022) · Physical Review A · doi:10.1103/physreva.105.032613 · Cited by 2
Gollub, C., von den Hoff, P., Kowalewski, M., Troppmann, U., & de Vivie‐Riedle, R. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch13 · Cited by 2
Periodicity and perfect state transfer in quantum walks on three families of graphsPreprint
Barr, K., Proctor, T., Allen, D., & Kendon, V. M. (2012) · arXiv (Cornell University) · Cited by 2
Song, P., Lü, X., Huang, P., Hao, X., & Yang, X. (2010) · Communications in Theoretical Physics · doi:10.1088/0253-6102/54/2/15 · Cited by 2
Quantum nonlocality of Heisenberg XX model with site-dependent coupling strength
Wu, C., Chen, J.-L., Tong, D. M., Kwek, L. C., & Oh, C. H. (2004) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/37/47/016 · Cited by 2
Dynamics of pairwise entanglement in the four-qubit HeisenbergXXspin chain
Guo, J., & Song, H. (2008) · Journal of Modern Optics · doi:10.1080/09500340802167532 · Cited by 2
One-Step Implementation of Single Spin Measurement in Spin Star Network
Hong-Liang, D., & Xi-Ming, F. (2008) · Chinese Physics Letters · doi:10.1088/0256-307x/25/2/007 · Cited by 2
Resources Needed for Entangling Two Qubits through an Intermediate Mesoscopic System
Mirkamali, M. S. (2019) · UWSpace (University of Waterloo) · Cited by 2
Waveguide QED toolboxes for universal quantum matterPreprint
Dong, Y., Taylor, J., Lee, Y. S., Kong, H. R., & Choi, K. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.02020 · Cited by 2
Tailoring quantum walks in integrated photonic lattices
Raymond, A., Cathala, P., Morassi, M., Lemaître, A., Raineri, F., Ducci, S., & Baboux, F. (2025) · Optics Express · doi:10.1364/oe.571522 · Cited by 1
The Seidel spectrum of two variants of join operations
Cheng, M.-J., Cui, S., & Tian, G. (2022) · Discrete Mathematics Algorithms and Applications · doi:10.1142/s1793830922501063 · Cited by 1
One-excitation spin dynamics in homogeneous closed chain governed by XX-Hamiltonian
Fel’dman, E. B., Kuznetsova, E. I., & Zenchuk, A. I. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04250-4 · Cited by 1
Zheng, L.-N., Wang, H., & Yi, X. X. (2024) · Chinese Journal of Physics · doi:10.1016/j.cjph.2024.05.042 · Cited by 1
Distribution of fidelity in quantum state transfer protocols
Lorenzo, S., Plastina, F., Apollaro, T. J. G., Consiglio, M., & Życzkowski, K. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130224 · Cited by 1
Quantum state transfer in ladder systems with cross-correlated disorder
Junior, M. S. S., Almeida, G. M. A., & de Moura, F. A. B. F. (2025) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2025.116249 · Cited by 1
QWAK: Quantum walk analysis kit
Santos, J., Chagas, B., Chaves, R., & Buffoni, L. (2025) · Computer Physics Communications · doi:10.1016/j.cpc.2025.109676 · Cited by 1
The quantum speed limit time of a two-qubit XYZ spin chain with intrinsic decoherence
Hou, L., Shao, B., & Zhu, Y. (2020) · Modern Physics Letters A · doi:10.1142/s0217732320502442 · Cited by 1
Laplacian pretty good fractional revival
Chan, A., Johnson, B., Liu, M., Schmidt, M., Yin, Z., & Zhan, H. (2022) · Discrete Mathematics · doi:10.1016/j.disc.2022.112971 · Cited by 1
Controllable Multiregister Transport on a Photonic Chip
Lu, Y., Chang, Y.-J., Wang, Y., Yang, Y., Yang, T.-H., Zhou, W., Wang, X., Gao, J., Tang, H. L., Zheng, H., et al. (2022) · ACS Photonics · doi:10.1021/acsphotonics.2c00678 · Cited by 1
Incorporating encoding into quantum system design
Kay, A. (2024) · Physical Review A · doi:10.1103/physreva.109.042408 · Cited by 1
Quantum Fractional Revival in Unitary Cayley Graphs
Soni, R., Choudhary, N., & Singh, N. (2025) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080224607264 · Cited by 1
Zhang, T.-T., Wu, J., Wang, Y., Su, S., & Shan, C. (2025) · Optics Express · doi:10.1364/oe.568261 · Cited by 1
Transfer of quantum-enhanced information through a many-body system
Wysocki, P., Płodzień, M., & Chwedeńczuk, J. (2025) · Physical Review A · doi:10.1103/3z4c-svn1 · Cited by 1
Ghosh, A. K., Souto, R. S., Mousolou, V. A., Black‐Schaffer, A. M., & Holmvall, P. (2025) · Physical review. B./Physical review. B · doi:10.1103/8zys-w2v4 · Cited by 3
Quantum fractional revival on unitary Cayley graphs over finite commutative rings
Jitngam, S., Kumam, P., & Sriwongsa, S. (2026) · Linear and Multilinear Algebra · doi:10.1080/03081087.2026.2619930 · Cited by 1
Collective purification of interacting quantum networks beyond symmetry constraints
Sur, S., Chattopadhyay, P., Chakrabarti, A., Palaiodimopoulos, N. E., Müstecaplıoğlu, Ö. E., Finkler, A., Dasari, D. B. R., & Kurizki, G. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01228-9 · Cited by 1
Kiryutin, A. S., Zhukov, I. V., Markelov, D. A., Dyke, E. V., Yurkovskaya, A. V., & Barskiy, D. (2026) · Journal of Magnetic Resonance Open · doi:10.1016/j.jmro.2026.100222 · Cited by 1
Microwave-to-optics topological pumping in Fock-state lattices with a nitrogen-vacancy spin
Wu, J., Zhang, T.-T., Song, P.-Y., Wang, Y., Gao, Y., & Su, S. (2026) · Photonics Research · doi:10.1364/prj.604042 · Cited by 1
Cascaded Rydberg antiblockade: Multi-atom excitation dynamics and entanglement
Wu, J.-L., Wu, J., Song, P.-Y., Wang, Y., Gao, Y., Song, X., & Su, S. (2026) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-026-3006-x · Cited by 1
Quantum enhanced dark-matter searching with entangled Fock states in high-quality cavities
Anonymous, You, X., Li, A. C. Y., Cervantes, R., Kim, T., Grassellino, A., Harnik, R., & Lu, Y. (2026) · Physical review. D/Physical review. D. · doi:10.1103/7cph-m1ln · Cited by 1
Quantum Entanglement Channel based on Excited States in a Spin Chain
Zhang, S., Du, L.-H., Guo, G., Zhou, X., & Zhou, Z.-W. (2011) · Chinese Physics Letters · doi:10.1088/0256-307x/28/12/120301 · Cited by 1
Brovko, O. O., Ignatiev, P. A., & Stepanyuk, V. S. (2011) · Physical Review B · doi:10.1103/physrevb.83.125415 · Cited by 1
ENTANGLEMENT DYNAMICS OF TRANSFERRING BELL STATES IN SPIN CHAINS
Ren, J., & Zhu, S. (2010) · International Journal of Modern Physics B · doi:10.1142/s0217979210054853 · Cited by 1
A Comparison of the Concurrence and the Quantum Discord in a Two-Qubit System
Yang, G.-H., & Wang, R. (2015) · Chinese Physics Letters · doi:10.1088/0256-307x/32/2/020302 · Cited by 1
QUANTUM INFORMATION TRANSFER IN A TWO-PARALLEL SPIN-CHAIN CHANNEL WITH INTERNAL AND EXTERNAL EFFECTS
Liu, J., Zhang, G., & Chen, Z. (2010) · International Journal of Modern Physics B · doi:10.1142/s0217979210055019 · Cited by 1
Transfer of an arbitrary two-qubit pure state with spin chains
Ma, J. Q., & Wang, A. M. (2012) · The European Physical Journal D · doi:10.1140/epjd/e2011-20313-y · Cited by 1
Bose-Mesner algebra on finite G/H coset graphs and its application on continuous time quantum walks
Jafarizadeh, M. A., Sufiani, R., Nami, S., & Golmohammadi, M. H. (2011) · Quantum Information Processing · doi:10.1007/s11128-011-0282-6 · Cited by 1
RENORMALIZATION-GROUP INVESTIGATION OF THE S = 1 RANDOM ANTIFERROMAGNETIC HEISENBERG CHAIN
Lajkó, P. (2006) · International Journal of Modern Physics C · doi:10.1142/s0129183106010169 · Cited by 1
Quantum state manipulation of dipole emitters with a plasmonic double-bar resonator
Cheng, L., Guo, Q., Wang, H., & Zhang, S. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0807-x · Cited by 1
Large effects of boundaries on spin amplification in spin chains
Roubert, B., Braun, P. A., & Braun, D. (2010) · Physical Review A · doi:10.1103/physreva.82.022302 · Cited by 1
State Transfer Hamiltonians in Photonic Lattices
Bellec, M., Nikolopoulos, G. M., & Tzortzakis, S. (2013) · Springer eBooks · doi:10.1007/978-3-642-39937-4_7 · Cited by 1
Integral trees with diameter four
Wang, L., Wang, Q., & Huo, B. (2016) · Applied Mathematics and Computation · doi:10.1016/j.amc.2016.02.002 · Cited by 1
Multiphoton Controllable Transport between Remote Resonators
Qin, W., & Long, G. (2016) · Entropy · doi:10.3390/e18060179 · Cited by 1
Зенчук, А. И., Zenchuk, A. I., & Доронин, С. И. (2016) · Теоретическая и математическая физика · doi:10.4213/tmf9103 · Cited by 1
Dissipation-assisted quantum correlations in coupled qubits
Joshi, C. (2016) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/116/14002 · Cited by 1
Investigations of the Quantum Correlation in Two-Qubit Heisenberg XYZ Model with Decoherence
Guo-Hui, Y. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3238-x · Cited by 1
One-Qubit and Two-Qubit Codes in Noisy State Transfer
Markiewicz, M., & Wieśniak, M. (2010) · Open Systems & Information Dynamics · doi:10.1142/s1230161210000096 · Cited by 1
Quantum correlations between distant qubits conveyed by large- S spin chains
Nuzzi, D., Cuccoli, A., Vaia, R., & Verrucchi, P. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.054449 · Cited by 1
Quantum control of quantum information perfect transfer in arbitrary-length spin chain
Wang, Q.-L., & Ren, H.-F. (2020) · Indian Journal of Physics · doi:10.1007/s12648-020-01835-y · Cited by 1
Xie, Y.-X., & Zhang, Y. (2021) · International Journal of Theoretical Physics · doi:10.1007/s10773-021-04800-5 · Cited by 1
Quantum-inspired multicore optical fiber
Kalita, A., Zhong, Q., Busch, K., & El‐Ganainy, R. (2022) · Optics Letters · doi:10.1364/ol.454684 · Cited by 1
Fidelity and Entanglement in the Open Spin Chain with Markovian and Non- Markovian Dynamics
Mahmoudi, M., & Khalkhali, T. F. (2022) · International Journal of Theoretical Physics · doi:10.1007/s10773-022-05089-8 · Cited by 1
Environment-assisted quantum state and distribution entanglement restoration in spin chain
Qiong, W., & He, Z. (2022) · Laser Physics · doi:10.1088/1555-6611/ac8fe7 · Cited by 1
Simulating many-body physics with quantum nonlinear optics
Chen, Z., Xu, X., Wang, Q., Han, Y., Li, C., & Guo, G. (2023) · Physical Review A · doi:10.1103/physreva.107.053711 · Cited by 1
Pepe, L., Pouthier, V., & Yalouz, S. (2024) · Physical review. E · doi:10.1103/physreve.109.014303 · Cited by 1
Pouthier, V., Pepe, L., & Yalouz, S. (2024) · Entropy · doi:10.3390/e26060490 · Cited by 1
Search and state transfer between hubs by quantum walks
Skoupý, S., & Štefaňák, M. (2024) · Physical Review A · doi:10.1103/physreva.110.022422 · Cited by 2
Leng, Y. (2024) · Laser Physics · doi:10.1088/1555-6611/ad6d55 · Cited by 1
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
