2012/06/30 by Austin G. Fowler · 3 citations
Computer Science · Physics and Astronomy · #Algorithm #Computation #Computer science #Initialization #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum computer #Quantum error correction #Quantum mechanics #Quantum-Dot Cellular Automata #Qubit #Word error rate #quant-ph
paper · pdf · doi:10.1103/physrevlett.109.180502
published as Phys. Rev. Lett. 109, 180502 (2012) · 5 pages, 4 figures, published version
openalex publication_date 2012/11/02 · arxiv created 2012/12/03 · arxiv updated 2012/12/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The field of quantum computation currently lacks a formal proof of experimental feasibility. Qubits are fragile and sophisticated quantum error correction is required to achieve reliable quantum computation. The surface code is a promising quantum error correction code, requiring only a physically reasonable 2D lattice of qubits with nearest neighbor interactions. However, existing proofs that reliable quantum computation is possible using this code assume the ability to measure four-body operators and, despite making this difficult to realize assumption, require that the error rate of these operator measurements is less than 10(-9), an unphysically low target. High error rates have been proved tolerable only when assuming tunable interactions of strength and error rate independent of distance, which is also unphysical. In this work, given a 2D lattice of qubits with only nearest neighbor two-qubit gates, and single-qubit measurement, initialization, and unitary gates, all of which have error rate p, we prove that arbitrarily reliable quantum computation is possible provided p < 7.4 × 10(-4), a target that many experiments have already achieved. This closes a long-standing open problem, formally proving the experimental feasibility of quantum computation under physically reasonable assumptions.