2009/04/22 by Thomas M. Stace, S. D. Barrett, Sean D. Barrett +1 · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer science #Information loss #Lattice (music) #Mathematics #Percolation threshold #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum mechanics #Quantum-Dot Cellular Automata #Set (abstract data type) #Square lattice #Statistical physics #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physrevlett.102.200501
4 pages, 3 figures. Accepted for publication in Phys. Rev. Lett., but comments still very welcome. TMS and SDB contributed equally to this work
arxiv created 2009/04/22 · openalex publication_date 2009/05/18 · arxiv updated 2015/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Many proposals for quantum information processing are subject to detectable loss errors. In this Letter, we show that topological error correcting codes, which protect against computational errors, are also extremely robust against losses. We present analytical results showing that the maximum tolerable loss rate is 50%, which is determined by the square-lattice bond percolation threshold. This saturates the bound set by the no-cloning theorem. Our numerical results support this and show a graceful trade-off between tolerable thresholds for computational and loss errors.