Quantum accuracy threshold for concatenated distance-3 codes
read the original abstract
We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \times 10^{-5} for an adversarial independent stochastic noise model, is derived from a computer-assisted combinatorial analysis; it is the best lower bound that has been rigorously proven so far.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
-
Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes
A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reducti...
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
-
Rigorous estimation of error thresholds of transversal Clifford logical circuits
Generalizes stat-mech mapping from toric code memories to transversal Clifford circuits, mapping tCNOT to random Ashkin-Teller and 4-body Ising models and estimating reduced thresholds of p=0.080 and p>=0.028.
-
Maximally Sensitive Sets of States
GHZ states in X, Y, and Z bases form a maximally sensitive set allowing straightforward tests to identify coherent errors in quantum gates, measurements, and state preparation.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.