The DOI matches its Crossref record; 8 of the 22 references it cites were found in a registry or an index, and 14 are not checked yet; none of the 4 sources its claims cite is checked for support yet.
Perfect State Transfer in Quantum Spin Networks
Open accessAbstract
We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication distance for hypercube geometries. Moreover, if one allows fixed but different couplings between the qubits, then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.
Checked 2026-10-06 · 14 references not checked yet
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proposes qubit networks that achieve perfect transfer of an arbitrary quantum state in a fixed time without switching qubit couplings. It shows perfect transfer in hypercubes and, with engineered fixed couplings, over arbitrarily long linear chains.
Key findings
- Perfect state transfer is possible between antipodes of one-link and two-link hypercubes, with constant transfer times \(t=\pi/2\) and \(t=\pi/\sqrt{2}\), respectively, independent of dimension.
- For \(N\)-qubit spin networks with identical couplings, the maximal perfect communication distance for hypercube geometries is \(2\log_3 N\); perfect transfer between antipodes of \(N\)-link hypercubes for \(N\ge 3\) is impossible.
- In an XY linear chain, perfect transfer occurs only for \(N=2\) and \(N=3\), with amplitudes \(F(t)=-i\sin(t)\) and \(F(t)=-[\sin(t\sqrt{2})]^2\); no perfect transfer occurs for \(N\ge 4\).
- With fixed but engineered couplings \(J_n=\frac{\lambda}{2}\sqrt{n(N-n)}\), perfect transfer over a chain of any length occurs in constant time \(t=\pi/\lambda\); a Heisenberg model with local magnetic fields can give the same dynamics.
Methods
- Theoretical analysis of continuous-time quantum walks on graphs: the network is a graph \(G\) with adjacency matrix \(A(G)\), and state-transfer dynamics is confined to the \(N\)-dimensional single-excitation subspace \(S_G\), where the Hamiltonian equals \(A(G)\).
- Perfect transfer is assessed via the amplitude \(F(t)=\langle N|e^{-iH_G t}|1\rangle\), with perfect transfer when \(|F(t)|=1\).
- The paper diagonalizes the XY linear chain, uses Cartesian products of two- and three-qubit chains to build hypercubes, and maps an engineered chain to a fictitious spin-\((N-1)/2\) particle governed by \(H=\lambda S_x\). No experimental data are used.
Limitations
- Stated: “we do not consider the effects of any other source of errors in this paper”; the paper also calls it an open problem whether an identical-coupling network can exceed the \(2\log_3 N\) distance.
- Stated: perfect transfer in an unmodulated XY linear chain is limited to \(N=2,3\), and perfect transfer between antipodes of \(N\)-link hypercubes for \(N\ge 3\) is impossible.
- Evident from the text: the scheme assumes idealized time-independent Hamiltonians and no dynamical control, requires pre-engineering couplings for arbitrary-length chains, and provides no experimental implementation or error analysis.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
32 No basis given · 8 Own interpretation · 4 Not checked yet · 3 Own result · 1 Own method
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“When restricted to N -qubit spin networks of identical qubit couplings, we show that 2 log 3 N is the maximal perfect communication distance for hypercube geometries.”
- Also stated in: § Perfect state transfer in quantum spin networks · p. 3 · boosted
“Thus we have shown that for a two-link hypercube of N sites, the maximum distance of perfect quantum communication is 2 log 3 N .”
boostedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Perfect state transfer in quantum spin networks · p. 3 · boosted
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“if one allows fixed but different couplings between the qubits then perfect state transfer can be achieved over arbitrarily long distances in a linear chain.”
- Also stated in: § Perfect state transfer in quantum spin networks · p. 4 · boosted
“In addition, we have shown that a quantum state can be transferred perfectly over a chain of any length as long as one can pre-engineer inter-qubit interactions.”
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Also stated in: § Perfect state transfer in quantum spin networks · p. 4 · boosted
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Perfect state transfer from one end of the chain to another is possible only for N = 2 and N = 3, with F ( t ) = -i sin( t ) and F ( t ) = -[ sin ( t √ 2 )] 2 respectively.”
plainn = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“We propose a class of qubit networks that admit perfect transfer of any quantum state in a fixed period of time.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“This means that the state | 1 〉 ≡ | 1 A 00 · · · 00 B 〉 must evolve into a superposition of states with exactly one spin 'up' and all other spins 'down'.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“the same as in the engineered chain.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The above matrix, Eq. (13), is identical to the representation of the Hamiltonian H of a fictitious spin S = 1 2 ( N -1) particle: H = λS x , where S x is its angular momentum operator and λ is some constant.”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The coefficient α does not change in time, as | 0 〉 is the zero-energy eigenstate of H G .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“with corresponding eigenvalues E k = -2 cos kπ N +1 for all k = 1 , . . . , N .”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The d -fold Cartesian product of a one-link chain (two qubits) and a two-link chain (three qubits) lead to onelink and two-link hypercubes with | F ( t ) | given, respectively, by”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- It may state two separate claims as one. 6
- Probably not a substantial claim. 6
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Perfect state transfer from one end of the chain to another is possible only for N = 2 and N = 3, with F ( t ) = -i sin( t ) and F ( t ) = -[ sin ( t √ 2 )] 2 respectively.”
plaincorrelationaln = 2- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Any quantum state can be perfectly transferred between the two antipodes of the one-link and two-link hypercubes of any dimensions in constant time t = π/ 2 and t = π/ √ 2 respectively [14].”
What the sources say
- Not checked yetcites [14] Note that continuous time quantum walk on the 1-link hypercube has recently been studied by C. Moore and A. Russell in Randomization and Approximation Techniques: 6th International Workshop, (RANDOM 2002), Lecture Notes in Computer Science , (Springer-Verlag, Heidelberg), vol. 2483, p. 164. source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The Hilbert space H G associated with a network of N qubits is of dimension 2 N .”
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“commutes with H G , which leads to the conservation of the total z -component of spin.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“These tasks can be also accomplished with the Heisenberg, or exchange, interaction by a suitable modulation of the network, e.g., by placing it in a static but, in general, non-uniform external magnetic field.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“For fixed N it maximizes the distance between A and B .”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“An improvement of the perfect quantum communication distance to N is, however, possible if one allows for different, but fixed, couplings between qubits on a chain.”
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“The classical mean hitting time between the antipodes in a one-link and two-link d -dimensional hypercube is given, for large d , by 2 d and 3 d , respectively.”
What the sources say
- Not checked yetcites [12] A. Bovier, Markov processes and meta-stability: Lecture notes for the Technical University of Berlin (2003). source
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It can also be used to transfer or to distribute quantum entanglement.”
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
In the paper
“Quantum communication over short distances through an unmodulated spin chain has been studied in detail, and an expression for the fidelity of quantum state has been obtained [9].”
What the sources say
- Not checked yetcites [9] S. Bose, Phys. Rev. Lett. 91 , 207901 (2003); V. Subrahmanyam, Phys. Rev. A 69 , 034304 (2004). source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
What the paper did — it cites no source for this, so there is none to check. The quote shows it is in the paper.
In the paper
“However, note that we do not consider the effects of any other source of errors in this paper.”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The authors state this as an assumption.
Initially all spins point down along a prescribed z-axis, i.e., the network is in the state |0> = |0_A 00...00_B>.
“we shall assume that initially all spins point 'down' along a prescribed z -axis, i.e. the network is in the state | 0 〉 = | 0 A 00 · · · 00 B 〉 .”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Inspired by spin chains [100-102] (see figure 12(a)), by tailoring the hopping rates between the waveguides of an array to match the matrix elements of the J x angular momentum operator, such a task becomes possible.”
From Integrated photonic quantum walks (2020) · cites this paper as [102]
Experimental — accuracy not yet measuredIn the citing paper
“From Eq. (5), the evolution time is limited by the minimum energy interval ∆ min ≡ min { ∆ k } , τ ≥ π/ ∆ min , while ˜ τ = π/ ˜ ∆ min .”
From Quantum speed limit for perfect state transfer in one dimension (2006) · cites this paper as [11]
In the citing paper
“This work also implies that quantum algorithms, when implemented in solid state devices, can be optimized, if we employ the concept of spin chain engineering [11].”
From Quantum speed limit for perfect state transfer in one dimension (2006) · cites this paper as [11]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ Perfect state transfer in quantum spin networks · p. 3
“An improvement of the perfect quantum communication distance to N is, however, possible if one allows for different, but fixed, couplings between qubits on a chain.”
§ Perfect state transfer in quantum spin networks · p. 1
“We define the distance between A and B to be the number of edges constituting the shortest path between them.”
Citations
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum Communication through an Unmodulated Spin Chain
Bose, S. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.207901 · Cited by 1,407
Experimental demonstration of a robust, high-fidelity geometric two ion-qubit phase gate
Leibfried, D., DeMarco, B., Meyer, V., Lucas, D., Barrett, M., Britton, J., Itano, W. M., Jelenković, B., Langer, C., Rosenband, T., et al. (2003) · Nature · doi:10.1038/nature01492 · Cited by 1,083
Universal quantum computation with the exchange interaction
DiVincenzo, D. P., Bacon, D., Kempe, J., Burkard, G., & Whaley, K. B. (2000) · Nature · doi:10.1038/35042541 · Cited by 924
Realization of the Cirac–Zoller controlled-NOT quantum gate
Schmidt-Kaler, F., Häffner, H., Riebe, M., Gulde, S., Lancaster, G. P. T., Deuschle, T., Becher, C., Roos, C. F., Eschner, J., & Blatt, R. (2003) · Nature · doi:10.1038/nature01494 · Cited by 875
Controlled collisions for multi-particle entanglement of optically trapped atoms
Mandel, O., Greiner, M., Widera, A., Rom, T., Hänsch, T. W., & Bloch, I. (2003) · Nature · doi:10.1038/nature02008 · Cited by 789
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Research works printed but not linked: 3
- 1978, Selected Topics in Graph Theory
- C. Moore, 2002, Randomization and Approximation Techniques: 6th International Workshop
- A. M. Childs, 2003, Proceedings of the 35th ACM Symposium on Theory of Computing (STOC 2003)
Cited by
Sorted by citations
Items 401–500 of 1,001
EFFICIENT AND PERFECT STATE TRANSFER IN QUANTUM CHAINS
Burgarth, D. K., Bose, S., & Giovannetti, V. (2006) · International Journal of Quantum Information · doi:10.1142/s0219749906001876 · Cited by 17
Discrete-Time Quantum Walk - Dynamics and ApplicationsPreprint
Madaiah, C. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.5326 · Cited by 22
Information transfer fidelity in spin networks and ring-based quantum routers
JONCKHEERE, E. A., Langbein, F. C., & Schirmer, S. G. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1136-4 · Cited by 16
Fast and controllable topological excitation transfers in hybrid magnon-photon systems
Han, J., Wu, J., Yuan, Z., Chen, Y., Xia, Y., Jiang, Y., & Song, J. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.014057 · Cited by 16
Ajoy, A., Kamineni, R. K., Kumar, A., & Rungta, P. (2012) · Physical Review A · doi:10.1103/physreva.85.030303 · Cited by 16
Quantum counterpart of measure synchronization: A study on a pair of Harper systems
Sur, S., & Ghosh, A. (2019) · Physics Letters A · doi:10.1016/j.physleta.2019.126176 · Cited by 16
Parallel entangling gate operations and two-way quantum communication in spin chains
Yousefjani, R., & Bayat, A. (2021) · Quantum · doi:10.22331/q-2021-05-26-460 · Cited by 17
Vibrational exciton mediated quantum state transfer: Simple model
Pouthier, V. (2012) · Physical Review B · doi:10.1103/physrevb.85.214303 · Cited by 16
Optimal quench for distance-independent entanglement and maximal block entropy
Alkurtass, B., Banchi, L., & Bose, S. (2014) · Physical Review A · doi:10.1103/physreva.90.042304 · Cited by 17
On the way to creation of materials for quantum computers
Aldoshin, S. M., Zenchuk, A. I., Fel'dman, E. B., & Yurishchev, M. A. (2012) · Russian Chemical Reviews · doi:10.1070/rc2012v081n02abeh004272 · Cited by 16
Walks and regular integral graphs
Stevanović, D., de Abreu, N. M. M., de Freitas, M. A. A., & Del-Vecchio, R. R. (2007) · Linear Algebra and its Applications · doi:10.1016/j.laa.2006.11.026 · Cited by 16
Generating quantum states through spin chain dynamics
Kay, A. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa68f9 · Cited by 16
Doronin, S. I., Fel’dman, E. B., & Zenchuk, A. I. (2009) · Physical Review A · doi:10.1103/physreva.79.042310 · Cited by 16
Analytical results for entanglement in the five-qubit anisotropic Heisenberg model
Wang, X. (2004) · Physics Letters A · doi:10.1016/j.physleta.2004.07.041 · Cited by 16
Many-particle interference in a two-component bosonic Josephson junction: an all-optical simulation
Dufour, G., Brünner, T., Dittel, C., Weihs, G., Keil, R., & Buchleitner, A. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8cf7 · Cited by 15
Reexamination of decoherence in quantum walks on the hypercube
Strauch, F. W. (2009) · Physical Review A · doi:10.1103/physreva.79.032319 · Cited by 16
Statistical theory of designed quantum transport across disordered networks
Walschaers, M., Mulet, R., Wellens, T., & Buchleitner, A. (2015) · Physical Review E · doi:10.1103/physreve.91.042137 · Cited by 15
Multipath adiabatic quantum state transfer
Chen, B., Fan, W., Xu, Y., Peng, Y., & Zhang, H. (2013) · Physical Review A · doi:10.1103/physreva.88.022323 · Cited by 15
Nondestructive photon counting in waveguide QED
Malz, D., & Cirac, J. I. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033091 · Cited by 16
Invariant-based inverse engineering of time-dependent, coupled harmonic oscillators
Tobalina, A., Torrontegui, E., Lizuain, I., Palmero, M., & Muga, J. G. (2020) · Physical Review A · doi:10.1103/physreva.102.063112 · Cited by 15
Serra, P., Ferrón, A., & Osenda, O. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128362 · Cited by 15
Fault-tolerant almost exact state transmission
Wang, Z.-M., Wu, L.-A., Modugno, M., Yao, W., & Shao, B. (2013) · Scientific Reports · doi:10.1038/srep03128 · Cited by 15
Entanglement of solitons in the Frenkel-Kontorova model
Marcovitch, S., & Reznik, B. (2008) · Physical Review A · doi:10.1103/physreva.78.052303 · Cited by 15
Seidel Integral Complete r-Partite Graphs
Wang, L., Zhao, G., & Li, K. (2012) · Graphs and Combinatorics · doi:10.1007/s00373-012-1276-6 · Cited by 15
Fernández-Alcázar, L. J., & Pastawski, H. M. (2015) · Physical Review A · doi:10.1103/physreva.91.022117 · Cited by 15
Quantum control theory for state transformations: Dark states and their enlightenment
Pemberton-Ross, P. J., Kay, A., & Schirmer, S. G. (2010) · Physical Review A · doi:10.1103/physreva.82.042322 · Cited by 15
Entanglement generation between distant parties via disordered spin chains
Almeida, G. M. A., de Moura, F. A. B. F., & Lyra, M. L. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2157-6 · Cited by 15
Matrasulov, D. U., Sabirov, K. K., & Yusupov, J. R. (2019) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ab03f8 · Cited by 15
Perfect state transfer in integral circulant graphs of non-square-free order
Bašić, M., & Petković, M. D. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2010.01.042 · Cited by 15
Entanglement in the Ground State of an Isotropic Three-Qubit Transverse XY Chain with Energy Current
Liu, D., Zhang, Y., Liu, Y., & Gui-Lu, L. (2007) · Chinese Physics Letters · doi:10.1088/0256-307x/24/1/003 · Cited by 15
Feldman, K. E. (2006) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/39/5/003 · Cited by 15
Naderi, N., Bordbar, M., Hasanvand, F. K., & Chamgordani, M. A. (2021) · Optik · doi:10.1016/j.ijleo.2021.167948 · Cited by 14
Customizable Quantum Control via Stimulated Raman User-Defined Passage
Niu, J., Liu, B.-J., Zhou, Y., Yan, T., Huang, W., Liu, W., Zhang, L., Jia, H., Liu, S., Yung, M., et al. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.034056 · Cited by 14
Two-dimensional quantum walk with position-dependent phase defects
Zhang, R., & Xue, P. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0775-1 · Cited by 14
Preservation of entanglement in a two-qubit-spin coupled system
Hou, Y.-C., Zhang, G.-F., Chen, Y., & Fan, H. (2011) · Annals of Physics · doi:10.1016/j.aop.2011.08.004 · Cited by 14
Transport and entanglement generation in the Bose–Hubbard model
Romero‐Isart, O., Eckert, K., Rodó, C., & Sanpera, A. (2007) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/40/28/s11 · Cited by 14
Tunable thermal entanglement in an effective spin-star system using coupled microcavities
Yang, W., Hua, W., Mang, F., & An, J. (2009) · Chinese Physics B · doi:10.1088/1674-1056/18/9/012 · Cited by 14
Quantum state transfer through a spin chain in a multiexcitation subspace
Wang, Z.-M., Ma, R., Bishop, C. A., & Gu, Y. (2012) · Physical Review A · doi:10.1103/physreva.86.022330 · Cited by 14
Analysis and minimization of bending losses in discrete quantum networks
Nikolopoulos, G. M., Hoskovec, A., & Jex, I. (2012) · Physical Review A · doi:10.1103/physreva.85.062319 · Cited by 14
Thermal entanglement in the mixed three-spinXXZHeisenberg model on a triangular cell
Han, S. D., & Aydıner, E. (2014) · Chinese Physics B · doi:10.1088/1674-1056/23/5/050305 · Cited by 14
Nie, S.-S., Ren, F.-H., He, R.-H., Wu, J., & Wang, Z.-M. (2021) · Physical Review A · doi:10.1103/physreva.104.052424 · Cited by 14
Tomography of time-dependent quantum Hamiltonians with machine learning
Han, C.-D., Glaz, B. J., Haile, M., & Lai, Y. (2021) · Physical Review A · doi:10.1103/physreva.104.062404 · Cited by 16
Khalid, I., Weidner, C. A., JONCKHEERE, E. A., Shermer, S., & Langbein, F. C. (2023) · Physical Review A · doi:10.1103/physreva.107.032606 · Cited by 15
Yuan, T., Zeng, C., Mao, Y.-Y., Wu, F.-F., Xie, Y.-J., Zhang, W., Dai, H.-N., Chen, Y.-A., & Pan, J.-W. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l032005 · Cited by 14
Coherent transfer by adiabatic passage in two-dimensional lattices
Longhi, S. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.05.020 · Cited by 14
Anonymous quantum network voting scheme
Li, Y., & Zeng, G. (2012) · Optical Review · doi:10.1007/s10043-012-0021-y · Cited by 14
Spin Guides and Spin Splitters: Waveguide Analogies in One-Dimensional Spin Chains
Makin, M. I., Cole, J. H., Hill, C. D., & Greentree, A. D. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.017207 · Cited by 14
Robustness of Spin-Chain State-Transfer Schemes
Stolze, J., Álvarez, G. A., Osenda, O., & Zwick, A. (2013) · Springer eBooks · doi:10.1007/978-3-642-39937-4_5 · Cited by 14
Coherent Transport in Photonic Lattices: A Survey of Recent Analytic Results
Universit&, Bossé, É.-O., #233, de Montr&, #233, al, C., Vinet, L., & Université de Montréal, C. (2017) · Symmetry Integrability and Geometry Methods and Applications · doi:10.3842/sigma.2017.074 · Cited by 16
Controlling probability transfer in the discrete-time quantum walk by modulating the symmetries
Chen, T., Wang, B., & Zhang, X. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8fe4 · Cited by 16
Perfect state transfer in NEPS of some graphs
Zheng, S., Liu, X., & Zhang, S. (2018) · Linear and Multilinear Algebra · doi:10.1080/03081087.2018.1548555 · Cited by 14
Continuous-time quantum walks on planar lattices and the role of the magnetic field
Razzoli, L., Paris, M. G. A., & Bordone, P. (2020) · Physical Review A · doi:10.1103/physreva.101.032336 · Cited by 14
Experimental realization of state transfer by quantum walks with two coins
Shang, Y., & Li, M. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab6025 · Cited by 14
Beam splitter for spin waves in quantum spin network
Yang, S., Song, Z., & Sun, C. P. (2006) · The European Physical Journal B · doi:10.1140/epjb/e2006-00319-2 · Cited by 14
Perfect quantum state transfer on the Johnson scheme
Ahmadi, B., Haghighi, M. H. S., & Mokhtar, A. (2019) · Linear Algebra and its Applications · doi:10.1016/j.laa.2019.09.021 · Cited by 14
Quantum state swapping via a qubit network with Hubbard interactions
Yang, S.-J., Song, Z., & Sun, C. P. (2006) · Physical Review B · doi:10.1103/physrevb.73.195122 · Cited by 14
Koniorczyk, M., Rapčan, P., & Bužek, V. (2005) · Physical Review A · doi:10.1103/physreva.72.022321 · Cited by 14
Universal composite pulses for robust quantum state engineering in four-level systems
Shi, Z., Wang, J.-H., Zhang, C., Song, J., & Xia, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.022441 · Cited by 15
Pouthier, V. (2012) · Journal of Physics Condensed Matter · doi:10.1088/0953-8984/24/44/445401 · Cited by 13
Quantum correlations in different density-matrix representations of spin-1/2 open chain
Fel’dman, E. B., & Zenchuk, A. I. (2012) · Physical Review A · doi:10.1103/physreva.86.012303 · Cited by 13
One-way Transfer of Quantum States via Decoherence
Matsuzaki, Y., Bastidas, V. M., Takeuchi, Y., Munro, W. J., & Saito, S. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.044003 · Cited by 13
Fast, high precision dynamics in quantum optimal control theory
Dalgaard, M., & Motzoi, F. (2022) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ac6366 · Cited by 13
Combating the effects of disorder in quantum state transfer
Keele, C., & Kay, A. (2022) · Physical Review A · doi:10.1103/physreva.105.032612 · Cited by 13
Effect of randomness on quantum data buses of Heisenberg spin chains
Oh, S., Shim, Y.-P., Fei, J., Friesen, M. G., & Hu, X. (2012) · Physical Review B · doi:10.1103/physrevb.85.224418 · Cited by 13
Exciton localization-delocalization transition in an extended dendrimer
Pouthier, V. (2013) · The Journal of Chemical Physics · doi:10.1063/1.4849756 · Cited by 13
Li, Y., Zhi, S., & Changpu, S. (2007) · Communications in Theoretical Physics · doi:10.1088/0253-6102/48/3/012 · Cited by 13
Perfect state transfer is poly-time
Coutinho, G., & Godsil, C. D. (2017) · Quantum Information and Computation · doi:10.26421/qic17.5-6-8 · Cited by 13
Robust quantum state transfer between two superconducting qubits via partial measurement
Li, Y., Yao, Y., & Xiao, X. M. (2016) · Laser Physics Letters · doi:10.1088/1612-2011/13/12/125202 · Cited by 13
Hamiltonian quantum computing with superconducting qubits
Ciani, A., Terhal, B. M., & Divincenzo, D. P. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab18dd · Cited by 14
Controllable two-qubit swapping gate using superconducting circuits
Rasmussen, S. E., Christensen, K. S., & Zinner, N. T. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.134508 · Cited by 13
The signless Laplacian state transfer in coronas
Tian, G., Yu, P.-K., & Cui, S. (2019) · Linear and Multilinear Algebra · doi:10.1080/03081087.2019.1594669 · Cited by 13
Optimal quantum search on truncated simplex lattices
Wang, Y., Wu, S., & Wang, W. (2020) · Physical Review A · doi:10.1103/physreva.101.062333 · Cited by 13
Statistics of a quantum-state-transfer Hamiltonian in the presence of disorder
Nikolopoulos, G. M. (2013) · Physical Review A · doi:10.1103/physreva.87.042311 · Cited by 13
Quantum dynamics of two-spin-qubit systems
Nguyễn, V. H. (2009) · Journal of Physics Condensed Matter · doi:10.1088/0953-8984/21/27/273201 · Cited by 13
Engineering massive quantum memories by topologically time-modulated spin rings
Giampaolo, S. M., Illuminati, F., Lisi, A., & Siena, S. D. (2006) · Laser Physics · doi:10.1134/s1054660x06100045 · Cited by 13
Controlling soliton excitations in Heisenberg spin chains through the magic angle
Lu, J., Zhou, L., Kuang, L., & Sun, C. P. (2009) · Physical Review E · doi:10.1103/physreve.79.016606 · Cited by 13
Yang, G.-H., & Zhou, L. (2008) · Physica Scripta · doi:10.1088/0031-8949/78/02/025703 · Cited by 13
Entanglement sudden death in a spin channel
Su, X. Q., Wang, A. M., MA, X. S., & Qiu, L. (2007) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/40/37/014 · Cited by 13
Transport and Entanglement Generation in the Bose-Hubbard ModelPreprint
Romero‐Isart, O., Eckert, K., Rodó, C., & Sanpera, A. (2007) · Cited by 13
End-to-end entanglement in Bose-Hubbard chains
Reslen, J., & Bose, S. (2009) · Physical Review A · doi:10.1103/physreva.80.012330 · Cited by 13
Chen, B., & Li, Y. (2016) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-016-5791-y · Cited by 12
Robust Multiple-Range Coherent Quantum State Transfer
Chen, B., Peng, Y.-D., Li, Y., & Qian, X.-F. (2016) · Scientific Reports · doi:10.1038/srep28886 · Cited by 12
Almost perfect transmission of multipartite entanglement through disordered and noisy spin chains
Vieira, R., & Rigolin, G. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126536 · Cited by 12
Laplacian state transfer in edge complemented coronas
Wang, J., & Liu, X. (2021) · Discrete Applied Mathematics · doi:10.1016/j.dam.2021.01.004 · Cited by 12
Controllable entangled-state distribution in a dual-rail reconfigurable optical network
Osawa, S., Simon, D. S., Malinovsky, V. S., & Sergienko, A. V. (2021) · Physical Review A · doi:10.1103/physreva.104.012617 · Cited by 13
Effect of emitters on quantum state transfer in coupled cavity arrays
Baum, E., Broman, A., Clarke, T., Costa, N. C., Mucciaccio, J., Yue, A., Zhang, Y., Norman, V. A., Patton, J., Radulaski, M., et al. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.195429 · Cited by 12
Dispersionless subradiant photon storage in one-dimensional emitter chains
Cech, M., Lesanovsky, I., & Olmos, B. (2023) · Physical Review A · doi:10.1103/physreva.108.l051702 · Cited by 12
Quantum Perfect State Transfer in a 2D Lattice
Post, S. (2014) · Acta Applicandae Mathematicae · doi:10.1007/s10440-014-9953-5 · Cited by 12
Neto, G. D. D. M., de Ponte, M. A., & Moussa, M. H. Y. (2011) · Physical Review A · doi:10.1103/physreva.84.032339 · Cited by 12
Optimized electron propagation on a quantum chain by a topological phase
Paganelli, S., Giorgi, G. L., & PASQUALE, F. D. (2009) · Fortschritte der Physik · doi:10.1002/prop.200900087 · Cited by 12
Perfect transfer of multiple excitations in quantum networks
Brougham, T., Nikolopoulos, G. M., & Jex, I. (2011) · Physical Review A · doi:10.1103/physreva.83.022323 · Cited by 12
Photon-assisted quantum state transfer and entanglement generation in spin chains
Gratsea, A., Nikolopoulos, G. M., & Lambropoulos, P. (2018) · Physical Review A · doi:10.1103/physreva.98.012304 · Cited by 12
Charge dynamics of a molecular ion immersed in a Rydberg-dressed atomic lattice gas
Mukherjee, R. (2019) · Physical Review A · doi:10.1103/physreva.100.013403 · Cited by 12
Robust entanglement transfer through a disordered qubit ladder
Almeida, G. M. A., Souza, A. M. C., de Moura, F. A. B. F., & Lyra, M. L. (2019) · Physics Letters A · doi:10.1016/j.physleta.2019.125847 · Cited by 12
Reconfigurable network for quantum transport simulations
Quiroz-Juarez, M. A., You, C., Carrillo-Martínez, J., Montiel-Álvarez, D., Aragón, J. L., Magaña‐Loaiza, O. S., & León-Montiel, R. D. J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013010 · Cited by 13
Transfer of zero-order coherence matrix along spin-1/2 chain
Bochkin, G. A., Fel’dman, E. B., Lazarev, I. D., Pechen, A. N., & Zenchuk, A. I. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03613-7 · Cited by 12
Heisenberg chains cannot mirror a state
Wieśniak, M. (2008) · Physical Review A · doi:10.1103/physreva.78.052334 · Cited by 12
Effective cutting of a quantum spin chain by bond impurities
Apollaro, T. J. G., Plastina, F., Banchi, L., Cuccoli, A., Vaia, R., Verrucchi, P., & Paternostro, M. (2013) · Physical Review A · doi:10.1103/physreva.88.052336 · Cited by 12
2-qubit quantum state transfer in spin chains and cold atoms with weak links
Lorenzo, S., Apollaro, T. J. G., Trombettoni, A., & Paganelli, S. (2017) · International Journal of Quantum Information · doi:10.1142/s021974991750037x · Cited by 12
Engineering the success of quantum walk search using weighted graphs
Wong, T. G., & Philipp, P. (2016) · Physical Review A · doi:10.1103/physreva.94.022304 · Cited by 13
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
