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.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/0406112Physical Review AMay 13, 2005247 citations

Perfect quantum state transfer on the Johnson scheme

Bahman Ahmadi, Mohammad Hassan Shirdareh Haghighi, Ahmad Mokhtar

arXiv:1710.09096Linear Algebra and its ApplicationsSep 24, 201912 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.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, 20040 citations

Perfect state transfer on spin-1 chains

M. Asoudeh, Vahid Karimipour

Quantum Information ProcessingNov 19, 20138 citations

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.