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

arXiv:1609.01854

A Note on the Speed of Perfect State Transfer

Alastair Kay, Xie, Weichen, Tamon, Christino

Published Sep 7, 2016• 9 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1609.01854

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

Perfect and Pretty Good 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 attempting to engineer arbitrarily accurate transfer, where explore a new paradigm that facilitates time estimates for achieving any target accuracy $\epsilon$ for the transfer.

•Jun 14, 2019•1 citation

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

Perfect transfer of arbitrary states in quantum spin networks

Matthias Christandl, Nilanjana Datta, T. C. Dorlas +3 more

We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. 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 $2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N$ 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. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).

arXiv:quant-ph/0411020•Physical Review A•Mar 14, 2005•527 citations

State transfer in static and dynamic spin chains with disorder

David Petrosyan, Georgios M. Nikolopoulos, P. Lambropoulos

We examine the speed and fidelity of several protocols for state or single excitation transfer in finite spin chains subject to diagonal and off-diagonal disorder. We find that, for a given chain length and maximal achievable interspin exchange ($\mathit{XY}$) coupling strength, the optimal static spin-coupling protocol, implementing the fastest state transfer between the two ends of the chain, is more susceptible to off-diagonal ($\mathit{XY}$ coupling) disorder, as compared to a much slower but robust adiabatic transfer protocol with time-dependent coupling strengths.

arXiv:1001.2444•Physical Review A•Apr 14, 2010•74 citations

Quantum state transfer in disordered spin chains: How much engineering is reasonable?

Analía Zwick, Gonzalo A. Álvarez, Joachim Stolze +1 more

The transmission of quantum states through spin chains is an important element in the implementation of quantum information technologies. Speed and fidelity of transfer are the main objectives which have to be achieved by the devices even in the presence of imperfections which are unavoidable in any manufacturing process. To reach these goals, several kinds of spin chains have been suggested, which differ in the degree of fine-tuning, or engineering, of the system parameters. In this work we present a systematic study of two important classes of such chains. In one class only the spin couplings at the ends of the chain have to be adjusted to a value different from the bulk coupling constant, while in the other class every coupling has to have a specific value. We demonstrate that configurations from the two different classes may perform similarly when subjected to the same kind of disorder in spite of the large difference in the engineering effort necessary to prepare the system. We identify the system features responsible for these similarities and we perform a detailed study of the transfer fidelity as a function of chain length and disorder strength, yielding empirical scaling laws for the fidelity which are similar for all kinds of chain and all disorder models. These results are helpful in identifying the optimal spin chain for a given quantum information transfer task. In particular, they help in judging whether it is worthwhile to engineer all couplings in the chain as compared to adjusting only the boundary couplings.

arXiv:1306.1695•Quantum Information and Computation•May 1, 2015•27 citations
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.
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.
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.
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.
We propose a class of qubit networks that admit perfect state transfer of any two-dimensional quantum state in a fixed period of time. We further show that such networks can distribute arbitrary entangled states between two distant parties, and can, by using such systems in parallel, transmit the higher-dimensional systems states across the network. 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 NNN-qubit spin networks of identical qubit couplings, we show that 2log3N2\phantom{\rule{0.2em}{0ex}}{\mathrm{log}}_{3}N2log3​N 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. This paper expands and extends the work done by Christandl et al., Phys. Rev. Lett. 92, 187902 (2004).
We examine the speed and fidelity of several protocols for state or single excitation transfer in finite spin chains subject to diagonal and off-diagonal disorder. We find that, for a given chain length and maximal achievable interspin exchange (XY\mathit{XY}XY) coupling strength, the optimal static spin-coupling protocol, implementing the fastest state transfer between the two ends of the chain, is more susceptible to off-diagonal (XY\mathit{XY}XY coupling) disorder, as compared to a much slower but robust adiabatic transfer protocol with time-dependent coupling strengths.
The transmission of quantum states through spin chains is an important element in the implementation of quantum information technologies. Speed and fidelity of transfer are the main objectives which have to be achieved by the devices even in the presence of imperfections which are unavoidable in any manufacturing process. To reach these goals, several kinds of spin chains have been suggested, which differ in the degree of fine-tuning, or engineering, of the system parameters. In this work we present a systematic study of two important classes of such chains. In one class only the spin couplings at the ends of the chain have to be adjusted to a value different from the bulk coupling constant, while in the other class every coupling has to have a specific value. We demonstrate that configurations from the two different classes may perform similarly when subjected to the same kind of disorder in spite of the large difference in the engineering effort necessary to prepare the system. We identify the system features responsible for these similarities and we perform a detailed study of the transfer fidelity as a function of chain length and disorder strength, yielding empirical scaling laws for the fidelity which are similar for all kinds of chain and all disorder models. These results are helpful in identifying the optimal spin chain for a given quantum information transfer task. In particular, they help in judging whether it is worthwhile to engineer all couplings in the chain as compared to adjusting only the boundary couplings.