2005/10/30 by Dorit Aharonov, Alexei Kitaev, John Preskill · 7 citations
Computer Science · Physics and Astronomy · #Algorithm #Computation #Computer science #Image (mathematics) #Noise (video) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum computer #Quantum error correction #Quantum mechanics #Qubit #Statistical physics #cond-mat.stat-mech #quant-ph
paper · pdf · doi:10.1103/physrevlett.96.050504
published as Phys. Rev. Lett. 96 (2006) 050504 · 4 pages
arxiv created 2005/10/30 · openalex publication_date 2006/02/07 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We prove a new version of the quantum accuracy threshold theorem that applies to non-Markovian noise with algebraically decaying spatial correlations. We consider noise in a quantum computer arising from a perturbation that acts collectively on pairs of qubits and on the environment, and we show that an arbitrarily long quantum computation can be executed with high reliability in D spatial dimensions, if the perturbation is sufficiently weak and decays with the distance r between the qubits faster than 1/r(D).