REVIEW 19 cited by
Fault-Tolerant Quantum Computation With Constant Error Rate
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very general, not necessarily probabilistic noise model, for quantum particles with any number of states, and is also generalized to one dimensional quantum computers with only nearest neighbor interactions. No measurements, or classical operations, are required during the quantum computation. The proceeding version was very succinct, and here we fill all the missing details, and elaborate on many parts of the proof. In particular, we devote a section for a discussion of universality issues and proofs that the sets of gates that we use are universal. Another section is devoted to a rigorous proof that fault tolerance can be achieved in the presence of general non probabilistic noise. The systematic structure of the fault tolerant procedures for polynomial codes is explained in length. The proof that the concatenation scheme works is written in a clearer way. The paper also contains new and significantly simpler proofs for most of the known results which we use. For example, we give a simple proof that it suffices to correct bit and phase flips, we significantly simplify Calderbank and Shor's original proof of the correctness of CSS codes. We also give a simple proof of the fact that two-qubit gates are universal. The paper thus provides a self contained and complete proof for universal fault tolerant quantum computation.
Forward citations
Cited by 19 Pith papers
-
Proof of a finite threshold for the union-find decoder
Union-find decoder for surface code achieves finite threshold under circuit-level stochastic errors with quasi-polylog parallel runtime bound.
-
Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
Blocklet concatenation yields fusion-based quantum computing protocols with constant-sized resource states, erasure thresholds up to 19.1%, and footprint per logical qubit scaling better than surface codes.
-
A distillation-teleportation protocol for fault-tolerant QRAM
An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.
-
A local automaton for the 2D toric code
A strictly local measurement-and-feedback decoder for the 2D toric code is built from hierarchical Tsirelson-type automata, preserving a logical qubit for times exponential in system size.
-
Restrictions on non-Clifford fault tolerance and ruling out beyond-SQL quantum metrology
Constant signal-aligned noise makes asymptotic beyond-SQL quantum sensing impossible for any protocol, including encoded, biased, adaptive, and nonstabilizer schemes.
-
A diagrammatic field theory of quantum error correction
Exact correctability of fusion-space codes is equivalent to fibrewise Knill–Laflamme conditions on syndrome-admissible footprint algebras, with a conditional Peierls threshold for growing families and explicit Ising e...
-
The Utility of Sparse Error Detection in Quantum Simulations
Sparse error detection in small Iceberg codes reduces systematic errors in simulated Schwinger-model observables under depolarizing noise, with diminishing returns after a few detection layers.
-
Fast mixing of all-to-all quantum systems at high temperatures
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
-
Optimizing bias-tailored quantum error correction beyond code-capacity noise
Under circuit-level noise the predicted advantage of bias-optimized rectangular surface codes over XZZX codes vanishes, while a new bias-filtering CNOT gadget recovers only a few-percent threshold improvement for XZZX codes.
-
Quantum circuit partition as a maze: emerging percolation transition via path finding
Quantum circuit partitioning is formalized as a maze path problem, revealing a percolation phase transition that separates partitionable from non-partitionable regimes when the CNOT-to-qubit ratio is near one.
-
Trapped-Ion Multiqubit Gates are Compatible with Scalable Quantum Error Correction
A noise model for trapped-ion multi-qubit gates shows that dominant error channels remain compatible with scalable rotated-surface-code quantum error correction when realistic experimental parameters are used.
-
Concatenating Algebraic Codes over High-Rate Quantum LDPC Codes
Concatenating quantum Reed-Solomon outer codes over the gross code using Galois qudits reaches teraquop regime at 10^{-3} physical noise with lower overhead than prior two-gross-code constructions.
-
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
Forced-gap post-selection on bivariate bicycle codes and surgery gadgets improves logical error rates by a factor of more than 4 using Relay-BP decoding at fixed post-selection rate.
-
Three-Qubit State Preparation: Classification and Explicit Circuits
A deterministic five-type classification of three-qubit pure states yields explicit, connectivity-aware circuit templates whose gate parameters are computed directly from the target amplitudes.
-
Renormalization Treatment of IR and UV Cutoffs in Waveguide QED and Implications to Numerical Model Simulation
Derives explicit non-perturbative renormalization relations between bare parameters and physical observables in waveguide QED to handle IR and UV cutoffs in simulations.
-
Efficient simulation of logical magic state preparation protocols
A classical simulation method that propagates circuit-level Pauli noise to a Clifford error makes logical magic-state preparation protocols simulable in time polynomial in qubits and the target state's stabilizer rank.
-
An apologia for islands
Entanglement islands and Page curves can arise in massless gravity without an external bath, and compactly supported gauge-invariant operators exist in islands around generic symmetry-breaking black hole backgrounds.
-
Spacetime Markov length: a diagnostic for fault tolerance via mixed-state phases
The paper introduces the spacetime Markov length: the decay length of conditional mutual information of syndrome history, and provides evidence that its divergence marks the fault-tolerance threshold.
-
Enhancing the Clique Local Decoder to Correct Length-2 Space Errors in the Surface Code
A modest extension of the Clique decoder, Clique_L2, corrects length-2 space error chains locally and cuts out-of-fridge decoding bandwidth by up to 18.38x under clustered noise models.
Discussion (0). Continue with ORCID to comment.