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/0502186 · New Journal of Physics

Perfect quantum state transfer with randomly coupled quantum chains

Daniel Klaus Burgarth, Sougato Bose

Published May 26, 2005• 156 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/7/1/135

Related papers

Efficient and perfect state transfer in quantum chains

Daniel Klaus Burgarth, Vittorio Giovannetti, Sougato Bose

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 is proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits.

arXiv:quant-ph/0410175•Journal of Physics A Mathematical and General•Jul 13, 2005•79 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•247 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

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

Conclusive and arbitrarily perfect quantum state transfer using amplitude delaying spin chain channels

Daniel Klaus Burgarth, Sougato Bose

We suggest a protocol for the transfer of quantum information in spin chain channels with a finite recurrence time. By combining a dual-rail encoding with certain measurements at the receiving end, we can get arbitrarily perfect state transfer, i.e. by performing sufficiently many measurements at the receiving end, we can make the probability of perfect state transfer arbitrary 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 in solid state quantum computers. Perfect state transfer with a probability of failure lower than delta in a Heisenberg chain of N spin-1/2 particles can be achieved in a timescale of the order of N^(7/3)*|ln(delta)|. Furthermore, the same scheme can be implemented using a single SU(n) chain which is realizable in quantum dot arrays.

•Jun 15, 2004•0 citations

Robust Quantum State Transfer in Random Unpolarized Spin Chains

Norman Y. Yao, Liang Jiang, Alexey Vyacheslavovich Gorshkov +4 more

We propose and analyze a new approach for quantum state transfer between remote spin qubits. Specifically, we demonstrate that coherent quantum coupling between remote qubits can be achieved via certain classes of random, unpolarized (infinite temperature) spin chains. Our method is robust to coupling-strength disorder and does not require manipulation or control over individual spins. In principle, it can be used to attain perfect state transfer over an arbitrarily long range via purely Hamiltonian evolution and may be particularly applicable in a solid-state quantum information processor. As an example, we demonstrate that it can be used to attain strong coherent coupling between nitrogen-vacancy centers separated by micrometer distances at room temperature. Realistic imperfections and decoherence effects are analyzed.

arXiv:1011.2762•Physical Review Letters•Jan 27, 2011•234 citations
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.
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 is proved which shows that the receiver is able to asymptotically recover the messages by repetitive monitoring of his qubits.
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 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.
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 suggest a protocol for the transfer of quantum information in spin chain channels with a finite recurrence time. By combining a dual-rail encoding with certain measurements at the receiving end, we can get arbitrarily perfect state transfer, i.e. by performing sufficiently many measurements at the receiving end, we can make the probability of perfect state transfer arbitrary 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 in solid state quantum computers. Perfect state transfer with a probability of failure lower than delta in a Heisenberg chain of N spin-1/2 particles can be achieved in a timescale of the order of N^(7/3)*|ln(delta)|. Furthermore, the same scheme can be implemented using a single SU(n) chain which is realizable in quantum dot arrays.
We propose and analyze a new approach for quantum state transfer between remote spin qubits. Specifically, we demonstrate that coherent quantum coupling between remote qubits can be achieved via certain classes of random, unpolarized (infinite temperature) spin chains. Our method is robust to coupling-strength disorder and does not require manipulation or control over individual spins. In principle, it can be used to attain perfect state transfer over an arbitrarily long range via purely Hamiltonian evolution and may be particularly applicable in a solid-state quantum information processor. As an example, we demonstrate that it can be used to attain strong coherent coupling between nitrogen-vacancy centers separated by micrometer distances at room temperature. Realistic imperfections and decoherence effects are analyzed.