2007/06/30 by Jingfu Zhang, Nageswaran Rajendran, Xinhua Peng +1 · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #quant-ph
paper · pdf · doi:10.1103/physreva.76.012317
published as Phys. Rev. A 76, 012317 (2007) · Version for submission. Comments are welcome
openalex publication_date 2007/07/17 · arxiv created 2007/07/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
Transferring quantum information between two qubits is a basic requirement for many applications in quantum communication and quantum-information processing. In the iterative quantum-state transfer proposed by Burgarth et al. [Phys. Rev. A 75, 062327 (2007)], this is achieved by a static spin chain and a sequence of gate operations applied only to the receiving end of the chain. The only requirement on the spin chain is that it transfers a finite part of the input amplitude to the end of the chain, where the gate operations accumulate the information. For an appropriate sequence of evolutions and gate operations, the fidelity of the transfer can asymptotically approach unity. We demonstrate the principle of operation of this transfer scheme by implementing it in a nuclear magnetic resonance quantum-information processor.