2009/10/31 by Austin G. Fowler, David S. Wang, Charles D. Hill +3 · 6 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.104.180503
published as Phys. Rev. Lett. 104, 180503 (2010) · 4 pages, 7 figures, 35% loss and 5% error sufficiently low to permit quantum data to be efficiently transmitted arbitrarily far and reliably at a rate limited only by the local gate speed
arxiv created 2010/02/05 · openalex publication_date 2010/05/06 · arxiv updated 2010/05/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Quantum communication typically involves a linear chain of repeater stations, each capable of reliable local quantum computation and connected to their nearest neighbors by unreliable communication links. The communication rate of existing protocols is low as two-way classical communication is used. By using a surface code across the repeater chain and generating Bell pairs between neighboring stations with probability of heralded success greater than 0.65 and fidelity greater than 0.96, we show that two-way communication can be avoided and quantum information can be sent over arbitrary distances with arbitrarily low error at a rate limited only by the local gate speed. This is achieved by using the unreliable Bell pairs to measure nonlocal stabilizers and feeding heralded failure information into post-transmission error correction. Our scheme also applies when the probability of heralded success is arbitrarily low.