2006/07/31 by David P. DiVincenzo, Panos Aliferis · 7 citations
Computer Science · Physics and Astronomy · #Algorithm #Computation #Computational science #Computer engineering #Computer science #Distributed computing #Fault tolerance #Implementation #Obstacle #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum mechanics #Scalability #quant-ph
paper · pdf · doi:10.1103/physrevlett.98.020501
published as Phys. Rev. Lett. 98 (2007) 220501 · 9 pages, 11 figures. v2: small changes and reference additions
arxiv created 2006/08/03 · openalex publication_date 2007/01/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
How important is fast measurement for fault-tolerant quantum computation? Using a combination of existing and new ideas, we argue that measurement times as long as even 1000 gate times or more have a very minimal effect on the quantum accuracy threshold. This shows that slow measurement, which appears to be unavoidable in many implementations of quantum computing, poses no essential obstacle to scalability.