2010/05/31 by S. D. Barrett, Sean D. Barrett, Thomas M. Stace · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Biology #Combinatorics #Computation #Computer science #Distributed computing #Fault tolerance #Lattice (music) #Mathematics #Percolation (cognitive psychology) #Percolation threshold #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum mechanics #Statistical physics #Topology (electrical circuits) #cond-mat.dis-nn #quant-ph
paper · pdf · doi:10.1103/physrevlett.105.200502
published as Phys. Rev. Lett. 105, 200502 (2010) · 4 pages, comments still very welcome. v2 is a reasonable approximation to the published version
openalex publication_date 2010/11/09 · arxiv created 2010/11/15 · arxiv updated 2015/03/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
Many proposals for fault tolerant quantum computation (FTQC) suffer detectable loss processes. Here we show that topological FTQC schemes, which are known to have high error thresholds, are also extremely robust against losses. We demonstrate that these schemes tolerate loss rates up to 24.9%, determined by bond percolation on a cubic lattice. Our numerical results show that these schemes retain good performance when loss and computational errors are simultaneously present.