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 801–900 of 1,001
A classical model for perfect transfer and fractional revival based on q-Racah polynomials
Schérer, H., Vinet, L., & Zhedanov, A. S. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.127973 · Cited by 4
Waveguide-QED platform for synthetic quantum matter
Dong, Y., Taylor, J., Lee, Y. S., Kong, H. R., & Choi, K. S. (2021) · Physical Review A · doi:10.1103/physreva.104.053703 · Cited by 4
State transfer on paths with weighted loops
Kirkland, S. J., & van Bommel, C. M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03558-x · Cited by 4
Quantum state transfer on square lattices with topology
Wei, M.-S., Liao, M.-J., Wang, Y., Lin, Z., Qiu, X., Wang, C., Xu, J., & Yang, Y. (2023) · Physical Review A · doi:10.1103/physreva.108.062401 · Cited by 5
Intrinsic Localized Modes in Quantum Ferromagnetic XXZ Chains in an Oblique Magnetic Field
Li, D. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2761-5 · Cited by 4
Polarization transitions in one-dimensional arrays of interacting rings
Roostaei, B., Mullen, K. J., & Rezakhani, A. T. (2008) · Physical Review B · doi:10.1103/physrevb.78.075411 · Cited by 4
Transfer of high-dimensional quantum state through an XXZ-Heisenberg quantum spin chain
Yang, Z., Gao, M., & Qin, W. (2015) · International Journal of Modern Physics B · doi:10.1142/s0217979215502070 · Cited by 4
Dan, G., Zhen-Shuang, Z., Zhu, A., Wang, H., Xiao-Qiang, S., & Shou, Z. (2010) · Chinese Physics B · doi:10.1088/1674-1056/19/9/090313 · Cited by 4
Using a quantum dot system to realize perfect state transfer
Ji, L., Wu, S.-H., Zhang, W.-W., & Xi, X.-Q. (2011) · Chinese Physics B · doi:10.1088/1674-1056/20/10/100308 · Cited by 4
Perfect quantum state transfer of hard-core bosons on weighted path graphs
Large, S. J., Underwood, M. S., & Feder, D. L. (2015) · Physical Review A · doi:10.1103/physreva.91.032319 · Cited by 4
Quantum correlations responsible for remote state creation: strong and weak control parameters
Doronin, S. I., & Zenchuk, A. I. (2017) · Quantum Information Processing · doi:10.1007/s11128-016-1514-6 · Cited by 4
How to suppress dark states in quantum networks and bio-engineered structures
Le, T. P., Donati, L., Simone Severini, B., & Caruso, F. (2018) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aad3e6 · Cited by 4
Dynamical model for positive-operator-valued measures
Pasquale, A. D., Foti, C., Cuccoli, A., Giovannetti, V., & Verrucchi, P. (2019) · Physical Review A · doi:10.1103/physreva.100.012130 · Cited by 4
Mesoscopic spin systems as quantum entanglers
Mirkamali, M. S., & Cory, D. G. (2020) · Physical Review A · doi:10.1103/physreva.101.032320 · Cited by 4
Continuous-time quantum walk on an extended star graph: Disorder-enhanced trapping process
Yalouz, S., & Pouthier, V. (2020) · Physical review. E · doi:10.1103/physreve.101.012310 · Cited by 4
Sur, S., & Subrahmanyam, V. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03641-3 · Cited by 4
Effective simulation of state distribution in qubit chains
Vlasov, A. Y. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2036-1 · Cited by 4
Quantum Dynamics of Spin Wave Propagation through Domain Walls
Yuan, S., Raedt, H. A. D., & Miyashita, S. (2006) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.75.084703 · Cited by 4
State transfers in vertex complemented coronas
Wang, J., & Liu, X. (2022) · Discrete Applied Mathematics · doi:10.1016/j.dam.2022.06.036 · Cited by 3
Armaghani, S., & Rostami, A. M. (2026) · Scientific Reports · doi:10.1038/s41598-025-34361-0 · Cited by 3
Ren, S., Wang, B., Qin, C., Liu, W., Zheng, L., Liu, Z., & Lu, P. (2024) · Physical Review A · doi:10.1103/physreva.109.043507 · Cited by 3
Quantum state transfer on 2D lattices: A low-energy effective Hamiltonian approach
Pushpan, C. B., Harikrishnan, K. J., & Pal, A. K. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.129543 · Cited by 4
Selected open problems in continuous-time quantum walks
Coutinho, G., & Guo, K. (2024) · Special Matrices · doi:10.1515/spma-2024-0025 · Cited by 3
Integral Cayley graphs over a group of order 6 n
Wang, J., Liu, X., & Wang, L. (2025) · Linear and Multilinear Algebra · doi:10.1080/03081087.2025.2480554 · Cited by 3
Machine learning assisted zero-area pulse design in an open quantum system
Li, Y.-Y., Wu, L.-A., & Wang, Z.-M. (2025) · Physical Review Research · doi:10.1103/11lg-bqbm · Cited by 3
Fast and efficient long-distance quantum state transfer in long-range spin- 1 2 models
Faria, F., Nelmes, C. C., Apollaro, T. J. G., Spiller, T. P., & D’Amico, I. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ae249f · Cited by 3
Using Josephson charge qubits system to realize the transfer of a special kind of quantum state
Shi-Hai, W., Hu, M., Ji, L., & Xi, X.-Q. (2011) · Acta Physica Sinica · doi:10.7498/aps.60.010302 · Cited by 3
Thermal Entanglement in a Two-Qubit Heisenberg XXZ Spin Chain Under a Single Pulse Magnetic Field
Liu, J., & Du, X.-H. (2013) · International Journal of Theoretical Physics · doi:10.1007/s10773-013-1550-2 · Cited by 3
Ge, R.-C., Li, C., & Guo, G. (2012) · Chinese Physics Letters · doi:10.1088/0256-307x/29/3/030307 · Cited by 3
Generating a GHZ state in 2m-qubit spin network
Jafarizadeh, M. A., Sufiani, R., Taghavi, S. F., Barati, E., Eghbalifam, F., & Azimi, M. (2011) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2011/05/p05014 · Cited by 3
BYPASSING STATE INITIALIZATION IN HAMILTONIAN TOMOGRAPHY ON SPIN-CHAINS
FRANCO, C. D., Paternostro, M., & KIM, M. S. (2011) · International Journal of Quantum Information · doi:10.1142/s0219749911007198 · Cited by 3
Sudden switch of correlation building velocity in a strong transverse field Ising spin chain
Guo, Y., Liu, Y., & Zhou, D. L. (2012) · The European Physical Journal D · doi:10.1140/epjd/e2012-30296-8 · Cited by 3
An Effective Heisenberg Spin Chain in a Fiber-Cavity System
Zhong, Z., Zhang, B., Xiu, L., & Su, W.-J. (2011) · Chinese Physics Letters · doi:10.1088/0256-307x/28/12/120303 · Cited by 3
Central symmetry in two-dimensional lattices and quantum information transmission
Wang, Z.-M., & Wu, L.-A. (2013) · Physical Review A · doi:10.1103/physreva.87.064301 · Cited by 3
Exciton-phonon system on a star graph: A perturbative approach
Yalouz, S., & Pouthier, V. (2016) · Physical review. E · doi:10.1103/physreve.93.052306 · Cited by 3
Quantum Correlation Properties in Composite Parity-Conserved Matrix Product States
Zhu, J.-M. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3042-7 · Cited by 3
Pretty good state transfer on 1-sum of star graphs
Hou, H., Gu, R., & Tong, M. (2018) · Open Mathematics · doi:10.1515/math-2018-0119 · Cited by 3
Which spin ladders are the most effective at transferring entanglements: two-legs or honeycombs!?
Motamedifar, M., Abbasi, M., Golshani, M., Mohamed, A. ‐. A., & Homid, A. H. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-04820-6 · Cited by 3
Remote restoring of (0,1)-excitation states and concurrence scaling
Tashkeev, N. A., & Zenchuk, A. I. (2024) · International Journal of Quantum Information · doi:10.1142/s0219749924500205 · Cited by 3
Some Aspects of Remote State Restoring in State Transfer Governed by XXZ-Hamiltonian
Bochkin, G. A., Doronin, S. I., Fel’dman, E. B., Kuznetsova, E. I., Lazarev, I. D., Pechen, A. N., & Zenchuk, A. I. (2024) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080224600596 · Cited by 3
A q-version of the relation between the hypercube, the Krawtchouk chain and Dicke states
Bernard, P.-A., Poliquin, É., & Vinet, L. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad94b9 · Cited by 3
Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks
Kubota, S., & Yoshino, K. (2025) · Journal of Combinatorial Theory Series A · doi:10.1016/j.jcta.2025.106064 · Cited by 3
Remotely detecting the signal of a local decohering process in spin chains
Sur, S., & Subrahmanyam, V. (2017) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/aa6730 · Cited by 3
Well-protected quantum state transfer in a dissipative spin chain
Behzadi, N., Ektesabi, A., & Ahansaz, B. (2018) · Scientific Reports · doi:10.1038/s41598-018-26220-y · Cited by 3
Quantum gates by resonantly driving many-body eigenstates, with a focus on Polychronakos’ model
Groenland, K., & Schoutens, K. (2019) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ab25e2 · Cited by 3
Super-quantum discord in ferromagnetic and antiferromagnetic materials
Fedorova, A. V., Byrnes, T., & Pyrkov, A. N. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2462-8 · Cited by 3
Perfect state transfer and maximal entanglement in a trimer of three-level systems
Aiyejina, A., Wyke, E., Andrews, R., & Greentree, A. D. (2023) · Physical Review A · doi:10.1103/physreva.108.032421 · Cited by 3
Perfect state transfer on quasi-abelian semi-Cayley graphs
Wang, S., Arezoomand, M., & Feng, T. (2024) · Journal of Algebraic Combinatorics · doi:10.1007/s10801-023-01288-6 · Cited by 3
Huang, L., Deng, M., Sun, C., & Li, F. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.014303 · Cited by 3
How to counteract systematic errors in quantum state transfer
Marletto, C., Kay, A., & EKERT, A. K. (2012) · Quantum Information and Computation · doi:10.26421/qic12.7-8-9 · Cited by 3
Self-citationDynamics of the entanglement over noisy quantum networks
Abdel‐Aty, A., Zakaria, N., & Mabrok, M. A. (2014) · International Conference on Computer and Information Sciences · doi:10.1109/iccoins.2014.6868409 · Cited by 3
Effects of impurity on fidelity of quantum state transfer via spin channels
Zhang, W.-W., Hu, M., & Tian, D.-P. (2010) · Physica B Condensed Matter · doi:10.1016/j.physb.2010.10.066 · Cited by 3
Chain-boson model for the decoherence and relaxation of a few coupled SQUIDs in a phonon bath
Skinner, A. J., & Hu, B. L. (2008) · Physical Review B · doi:10.1103/physrevb.78.014302 · Cited by 3
Effects of Staggered Magnetic Field on Entanglement in the Anisotropic XY Model
Zhe, S., & Wang, X. (2006) · Communications in Theoretical Physics · doi:10.1088/0253-6102/45/1/011 · Cited by 3
Entanglement Transfer via Heisenberg Interaction in a Four-Qubit System
Ren, F.-H., & Wang, Z.-M. (2007) · Communications in Theoretical Physics · doi:10.1088/0253-6102/47/4/010 · Cited by 3
Cooling ultracold bosons in optical lattices by spectral transform
Feder, D. L. (2009) · Physical Review A · doi:10.1103/physreva.79.013604 · Cited by 3
Quantum communication and state transfer in spin chains
Jeugt, J. V. D. (2011) · Journal of Physics Conference Series · doi:10.1088/1742-6596/284/1/012059 · Cited by 3
Quantum Cryptography in Spin Networks
Hong-Liang, D., & Xi-Ming, F. (2007) · Chinese Physics Letters · doi:10.1088/0256-307x/24/11/010 · Cited by 3
Quantum Correlation in Matrix Product States of One-Dimensional Spin Chains*
Zhu, J.-M. (2015) · Communications in Theoretical Physics · doi:10.1088/0253-6102/64/3/356 · Cited by 3
Identifying quantum states capable of high-fidelity transmission over a spin chain
Wang, Z.-M., Wu, L.-A., Bishop, C. A., Gu, Y., & Byrd, M. (2013) · Physical Review A · doi:10.1103/physreva.88.032303 · Cited by 3
Wang, Q., He, Z., Yao, C., & Li, W. (2016) · International Journal of Theoretical Physics · doi:10.1007/s10773-016-3002-2 · Cited by 3
Robustness of optimal transport in one-dimensional particle quantum networks
Javaherian, C., & Twamley, J. (2014) · Physical Review A · doi:10.1103/physreva.90.042313 · Cited by 3
Hanoura, S. A., Ahmed, M. M. A., Khalil, E. M., & Obada, A. ‐. F. (2018) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2018.05.032 · Cited by 3
Efficient routing quantum information in one-dimensional tight-binding array
Chen, B., He, Y.-Z., Chu, T.-T., Shen, Q.-H., Zhang, J., & Peng, Y. (2020) · Progress of Theoretical and Experimental Physics · doi:10.1093/ptep/ptaa051 · Cited by 3
Pretty good state transfer on Cayley graphs over semi-dihedral groups
Wang, D., & Cao, X. (2021) · Linear and Multilinear Algebra · doi:10.1080/03081087.2021.1926414 · Cited by 3
Transfer of Quantum Continuous Variable and Qudit States in Quantum Networks
Sawerwain, M., & Gielerak, R. (2012) · Communications in computer and information science · doi:10.1007/978-3-642-31217-5_7 · Cited by 3
Ren, J., & Zhu, S. (2008) · Physical Review A · doi:10.1103/physreva.77.034303 · Cited by 3
Xie, Y.-X., & Gao, Y.-Y. (2019) · Laser Physics Letters · doi:10.1088/1612-202x/ab3bcb · Cited by 3
Generation and robustness of quantum entanglement in spin graphs
Riegelmeyer, J., Wignall, D., Estarellas, M. P., D’Amico, I., & Spiller, T. P. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02943-8 · Cited by 4
Algorithms for finding the maximum clique based on continuous time quantum walks
Li, X., Wu, M., Chen, H., & Liu, Z. (2021) · Quantum Information and Computation · doi:10.26421/qic21.1-2-4 · Cited by 4
M -neighbor approximation in one-qubit state transfer along zigzag and alternating spin-1/2 chains
Fel’dman, E. B., & Zenchuk, A. I. (2022) · Physica Scripta · doi:10.1088/1402-4896/ac8456 · Cited by 3
Programmable Quantum State TransferPreprint
Vlasov, A. Y. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0708.0145 · Cited by 3
Dynamics of Entanglement In One‐ and Two‐Dimensional Spin Systems
Sadiek, G., Xu, Q. Y., & Kais, S. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch15 · Cited by 3
The 3-dimensional cube is the only periodic, connected cubic graph with perfect state transfer
Simone Severini, B. (2010) · Journal of Physics Conference Series · doi:10.1088/1742-6596/254/1/012012 · Cited by 4
Quantum Information Processing in Multi-Spin Systems
Cappellaro, P. (2006) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Quantum Walks and Pretty Good State transfer on Paths
van Bommel, & Martin, C. (2019) · UWSpace (University of Waterloo) · Cited by 3
Pretty Good State Transfer and Minimal PolynomialsPreprint
van Bommel, C. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.06779 · Cited by 3
Cheng, Y., Zhai, K., Zhu, N., & Sun, M. (2022) · Journal of Physics D Applied Physics · doi:10.1088/1361-6463/ac4fd6 · Cited by 2
One-dimensional continuous-time quantum Markov chains: qubit probabilities and measures
de la Iglesia, M. D., & Lardizabal, C. F. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad5bcb · Cited by 2
Fractional revival on semi-Cayley graphs over abelian groups
Wang, J., Wang, L., & Liu, X. (2024) · Linear and Multilinear Algebra · doi:10.1080/03081087.2024.2435413 · Cited by 4
Quantum-preserved transport of excitations in Rydberg-dressed atom arrays
Li, P., Qian, J., & Zhang, W. (2025) · Quantum Frontiers · doi:10.1007/s44214-025-00078-4 · Cited by 2
Quantum state transfer on 𝒬-graphs
Zhang, X.-Q., Cui, S., & Tian, G. (2025) · RAIRO - Operations Research · doi:10.1051/ro/2025046 · Cited by 2
Quantum routing based on chiral state transfer in arbitrary N -node networks
Feng, W., Wei, Z., Zhang, G.-Q., Li, J., Zhang, J., & Yang, C. (2025) · Physical Review A · doi:10.1103/physreva.111.042423 · Cited by 2
Djoufack, Z. I., Nguenang, J. P., & Kenfack-Jiotsa, A. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-05999-3 · Cited by 2
Perfect transfer of arbitrary continuous variable states across optical waveguide lattices
Anuradha, T., Patra, A., Gupta, R., & Sen, A. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130746 · Cited by 3
Efficient Large‐Scale Entanglement with Domain‐Divided Topological Synthetic Dimension
Han, J., Wu, J., Wang, Y., Xia, Y., Jiang, Y., & Song, J. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500362 · Cited by 2
Laplacian quantum walks on blow-up graphs
Monterde, H., Pal, H., & Kirkland, S. (2025) · Linear Algebra and its Applications · doi:10.1016/j.laa.2025.10.001 · Cited by 2
Quasiconservation laws and suppressed transport in weakly interacting localized models
Jiang, J. K., Surace, F. M., & Motrunich, O. I. (2025) · Physical review. B./Physical review. B · doi:10.1103/shj5-bvs3 · Cited by 4
Remote Entanglement Generation Via Enhanced Quantum State Transfer
Wang, T.-L., Wang, P., Zhao, Z., Zhang, S., Zhao, R.-Z., Yang, X., Zhang, H., Li, Z., Wu, Y. S., Guo, L.-L., et al. (2026) · PRX Quantum · doi:10.1103/4x8d-cmyx · Cited by 2
Enhanced algorithmic perfect state transfer on IBM quantum computers
Ge, Z., Wu, L., & Wang, Z.-M. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4421 · Cited by 2
Remote control of quantum correlations in a two-qubit receiver by a three-qubit sender
Doronin, S. I., & Zenchuk, A. I. (2016) · Theoretical and Mathematical Physics · doi:10.1134/s0040577916080092 · Cited by 2
Spin chain transformations under continuous driving fields
Soomro, H., & Chaudhry, A. Z. (2022) · The European Physical Journal D · doi:10.1140/epjd/s10053-022-00509-0 · Cited by 2
Robust quantum state transfer by optimal invariant-based reverse engineering
Zhang, C., Chen, X., Shen, S.-J., & Lin, X. (2022) · Optics Express · doi:10.1364/oe.472909 · Cited by 2
Fel’dman, E. B., & Zenchuk, A. I. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128572 · Cited by 2
Transfer of quantum states through a disordered channel with exponentially decaying couplings
Filho, F. J. A., Dutra, R. F., Santos, I. F., Lyra, M. L., Almeida, G. M. A., & de Moura, F. A. B. F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04083-1 · Cited by 2
Scalable Quantum Spin Networks from Unitary Construction
Alsulami, A. H., D’Amico, I., Estarellas, M. P., & Spiller, T. P. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300238 · Cited by 2
Xie, Y.-X., & Sun, Y. (2024) · Results in Physics · doi:10.1016/j.rinp.2024.107547 · Cited by 2
Quantum state transfer in interacting multiple-excitation systems
Yue, A., Mondaini, R., Guo, Q., & Scalettar, R. T. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.195410 · Cited by 2
Fractional revival on integral mixed circulant graphs
Soni, R., Choudhary, N., & Singh, N. P. (2025) · Boletim da Sociedade Paranaense de Matemática · doi:10.5269/bspm.68875 · Cited by 2
Controllable quantum state transfer via XY -type exchange interaction of flux qubits
Shi, J., Chen, S., Zhu, H., Ding, Z., He, J., Yu, L., Zhao, S., & Wu, T. (2018) · Laser Physics Letters · doi:10.1088/1612-202x/aad94a · Cited by 3
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
