Fault-Tolerant Quantum Computation With Constant Error Rate
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 10 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.
-
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 codes over the gross code via Galois qudits reaches teraquop regime at uniform 10^{-3} noise with reduced overhead.
-
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
A forced-gap post-selection strategy using repeated Relay-BP decoder runs improves logical error rates by over 4x on 72- and 144-qubit bivariate bicycle codes at fixed post-selection rate.
-
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.
-
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.