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:quant-ph/0406112 · Physical Review A

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

Daniel Klaus Burgarth, Sougato Bose

Published May 13, 2005• 247 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.71.052315

Related papers

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•16 citations

Quantum-state transfer on spin-chain channels with noise

De-Xin Kong, An Min Wang

We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10], we propose a protocol that can avoid the quantum noises introduced by many unnecessary measurements and can enhance the anti-decoherence ability. The results show that our protocol is more efficient to transfer an arbitrary quantum state than the original one. In particular, we discuss the effects of couplings fluctuations and imperfect initialization on both of the improved scheme and original one.

•Feb 14, 2009•0 citations

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•1 citation

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•519 citations

Quantum communication through spin chain dynamics: an introductory overview

Sougato Bose

We present an introductory overview of the use of spin chains as quantum wires, which has recently developed into a topic of lively interest. The principal motivation is in connecting quantum registers without resorting to optics. A spin chain is a permanently coupled 1D system of spins. When one places a quantum state on one end of it, the state will be dynamically transmitted to the other end with some efficiency if the spins are coupled by an exchange interaction. No external modulations or measurements on the body of the chain, except perhaps at the very ends, is required for this purpose. For the simplest (uniformly coupled) chain and the simplest encoding (single qubit encoding), however, dispersion reduces the quality of transfer. We present a variety of alternatives proposed by various groups to achieve perfect quantum state transfer through spin chains. We conclude with a brief discussion of the various directions in which the topic is developing.

arXiv:0802.1224•Contemporary Physics•Jan 1, 2007•484 citations

Perfect quantum state transfer with randomly coupled quantum chains

Daniel Klaus Burgarth, Sougato Bose

We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they are relatively weak (say 5%). Furthermore, we show that given a quite arbitrary pair of quantum chains, one can check whether it is capable of perfect transfer by only local operations at the ends of the chains, and the system in the middle being a 'black box'. We argue that unless some specific symmetries are present in the system, it will be capable of perfect transfer when used with dual-rail encoding. Therefore our scheme puts minimal demand not only on the control of the chains when using them, but also on the design when building them.

arXiv:quant-ph/0502186•New Journal of Physics•May 26, 2005•156 citations
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ℏ∕J)N1.7\ensuremath∣lnP\ensuremath∣(0.33\ensuremath{\hbar}∕J){N}^{1.7}\ensuremath{\mid}\mathrm{ln}\phantom{\rule{0.2em}{0ex}}P\ensuremath{\mid}(0.33\ensuremathℏ∕J)N1.7\ensuremath∣lnP\ensuremath∣. 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].
We investigate the quantum-state transfer on spin-chian channels with random imperfections.Through combining the advantages of two known schemes, the dual-rail spin-chain channels[9] and the particular ihhomogenous spin-chain channel[10], we propose a protocol that can avoid the quantum noises introduced by many unnecessary measurements and can enhance the anti-decoherence ability. The results show that our protocol is more efficient to transfer an arbitrary quantum state than the original one. In particular, we discuss the effects of couplings fluctuations and imperfect initialization on both of the improved scheme and original one.
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 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 present an introductory overview of the use of spin chains as quantum wires, which has recently developed into a topic of lively interest. The principal motivation is in connecting quantum registers without resorting to optics. A spin chain is a permanently coupled 1D system of spins. When one places a quantum state on one end of it, the state will be dynamically transmitted to the other end with some efficiency if the spins are coupled by an exchange interaction. No external modulations or measurements on the body of the chain, except perhaps at the very ends, is required for this purpose. For the simplest (uniformly coupled) chain and the simplest encoding (single qubit encoding), however, dispersion reduces the quality of transfer. We present a variety of alternatives proposed by various groups to achieve perfect quantum state transfer through spin chains. We conclude with a brief discussion of the various directions in which the topic is developing.
We suggest a scheme that allows arbitrarily perfect state transfer even in the presence of random fluctuations in the couplings of a quantum chain. The scheme performs well for both spatially correlated and uncorrelated fluctuations if they are relatively weak (say 5%). Furthermore, we show that given a quite arbitrary pair of quantum chains, one can check whether it is capable of perfect transfer by only local operations at the ends of the chains, and the system in the middle being a 'black box'. We argue that unless some specific symmetries are present in the system, it will be capable of perfect transfer when used with dual-rail encoding. Therefore our scheme puts minimal demand not only on the control of the chains when using them, but also on the design when building them.