Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Perfect and Pretty Good State Transfer for Field-Free Heisenberg Chains

Alastair Kay

Published Jun 14, 2019• 1 citation
OpenAlex

Abstract

In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In attempting to engineer arbitrarily accurate transfer, where explore a new paradigm that facilitates time estimates for achieving any target accuracy $\epsilon$ for the transfer.

Related papers

The Limits of Quantum State Transfer for Field-Free Heisenberg Chains

Alastair Kay

In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of perfect transfer, we consider a range of options for achieving high quality transfer, whether in finite time, or via "pretty good" transfer where one waits long times in the hope of getting arbitrarily close to perfect transfer. In attempting to engineer arbitrarily accurate transfer, we explore a new paradigm that facilitates time estimates for achieving any target accuracy $ε$ for the transfer.

arXiv:1906.06223•Jun 14, 2019•5 citations

Engineered spin chains for perfect quantum state transfer

Bich Ha Nguyen, Văn Hiếu Nguyễn

Abstract The transfer of quantum states along spin chains with the XY Heisenberg exchange interaction between nearest-neighbour spins and without decoherence was studied. It was shown that there exists a wide class of engineered mirror-symmetric N-spin-chains that allow the perfect quantum state transfer from one end of each chain to the other. The sets of values of physical parameters of these N-spin-chains were established.

Advances in Natural Sciences Nanoscience and Nanotechnology•Jun 1, 2010•8 citations

Conclusive and arbitrarily perfect quantum-state transfer using parallel spin-chain channels

Daniel Klaus Burgarth, Sougato Bose

We suggest a protocol for perfect quantum communication through spin-chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success can be made arbitrarily close to unity. As an example of such an amplitude-delaying channel, we show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than $P$ in a Heisenberg chain of $N$ spin-$\frac{1}{2}$ particles can be achieved in a timescale of the order of $(0.33\ensuremath{\hbar}∕J){N}^{1.7}\ensuremath{\mid}\mathrm{ln}\phantom{\rule{0.2em}{0ex}}P\ensuremath{\mid}$. We demonstrate that our scheme is more robust to decoherence and nonoptimal timing than any scheme using single spin chains.

arXiv:quant-ph/0406112•Physical Review A•May 13, 2005•249 citations

EFFICIENT AND PERFECT STATE TRANSFER IN QUANTUM CHAINS

Daniel Klaus Burgarth, Sougato Bose, Vittorio Giovannetti

We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number of chains employed in the scheme. The system consists of M uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits, a theorem can be proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits. We show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than P in a Heisenberg chain of N spin-1/2 particles can be achieved in a time scale of the order of [Formula: see text].

International Journal of Quantum Information•Jun 1, 2006•17 citations

A Note on the Speed of Perfect State Transfer

Alastair Kay, Xie, Weichen, Tamon, Christino

In Phys. Rev. A 74, 030303 (2006), Yung showed that for a one-dimensional spin chain of length $N$ and maximum coupling strength $J_{\max}$, the time $t_0$ for a quantum state to transfer from one end of the chain to another is bounded by $J_{\max} t_0\geqπN/4$ (even $N$) and $J_{\max} t_0\geqπ\sqrt{N^2-1}/4$ (odd $N$). The proof for even $N$ was elegant, but the proof for odd $N$ was less so. This note provides a proof for the odd $N$ case that is simpler, and more in keeping with the proof for the even case.

arXiv:1609.01854•Sep 7, 2016•9 citations

Quantum speed limit for perfect state transfer in one dimension

Man‐Hong Yung

The basic idea of spin-chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian such that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical controls. The minimal possible evolution time represents a speed limit for QST. We prove that the optimal solution is the one simulating the precession of a spin in a static magnetic field. We also argue that, at least for solid-state systems where interactions are local, it is more realistic to characterize the computation power by the couplings than the initial energy.

arXiv:quant-ph/0603179•Physical Review A•Sep 14, 2006•130 citations
In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In attempting to engineer arbitrarily accurate transfer, where explore a new paradigm that facilitates time estimates for achieving any target accuracy ϵ\epsilonϵ for the transfer.
In a one-dimensional Heisenberg chain, we show that there are no sets of coupling strengths such that the evolution perfectly transfers a quantum state between the two ends of the chain without the addition of magnetic fields. In lieu of perfect transfer, we consider a range of options for achieving high quality transfer, whether in finite time, or via "pretty good" transfer where one waits long times in the hope of getting arbitrarily close to perfect transfer. In attempting to engineer arbitrarily accurate transfer, we explore a new paradigm that facilitates time estimates for achieving any target accuracy εεε for the transfer.
We suggest a protocol for perfect quantum communication through spin-chain channels. By combining a dual-rail encoding with measurements only at the receiving end, we can get conclusively perfect state transfer, whose probability of success can be made arbitrarily close to unity. As an example of such an amplitude-delaying channel, we show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than PPP in a Heisenberg chain of NNN spin-12\frac{1}{2}21​ particles can be achieved in a timescale of the order of $(0.33\ensuremath{\hbar}∕J){N}^{1.7}\ensuremath{\mid}\mathrm{ln}\phantom{\rule{0.2em}{0ex}}P\ensuremath{\mid}$. We demonstrate that our scheme is more robust to decoherence and nonoptimal timing than any scheme using single spin chains.
We present a communication protocol for chains of permanently coupled qubits which achieves perfect quantum state transfer and which is efficient with respect to the number of chains employed in the scheme. The system consists of M uncoupled identical quantum chains. Local control (gates, measurements) is only allowed at the sending/receiving end of the chains. Under a quite general hypothesis on the interaction Hamiltonian of the qubits, a theorem can be proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits. We show how two parallel Heisenberg spin chains can be used as quantum wires. Perfect state transfer with a probability of failure lower than P in a Heisenberg chain of N spin-1/2 particles can be achieved in a time scale of the order of [Formula: see text].
In Phys. Rev. A 74, 030303 (2006), Yung showed that for a one-dimensional spin chain of length NNN and maximum coupling strength Jmax⁡J_{\max}Jmax​, the time t0t_0t0​ for a quantum state to transfer from one end of the chain to another is bounded by Jmax⁡t0≥πN/4J_{\max} t_0\geqπN/4Jmax​t0​≥πN/4 (even NNN) and Jmax⁡t0≥πN2−1/4J_{\max} t_0\geqπ\sqrt{N^2-1}/4Jmax​t0​≥πN2−1​/4 (odd NNN). The proof for even NNN was elegant, but the proof for odd NNN was less so. This note provides a proof for the odd NNN case that is simpler, and more in keeping with the proof for the even case.
The basic idea of spin-chain engineering for perfect quantum state transfer (QST) is to find a set of coupling constants in the Hamiltonian such that a particular state initially encoded on one site will evolve freely to the opposite site without any dynamical controls. The minimal possible evolution time represents a speed limit for QST. We prove that the optimal solution is the one simulating the precession of a spin in a static magnetic field. We also argue that, at least for solid-state systems where interactions are local, it is more realistic to characterize the computation power by the couplings than the initial energy.