nLab error threshold theorem

Redirected from "error threshold theorems".

Contents

Idea

In the theory of computation, a threshold theorem (short for error threshold) states that when the error-rates of realistic logic gate-components are below a given threshold, then error correction can achieve an arbitrarily error-free computation.

For classical computation, where an early version of this statement is due to von Neumman 1956, the reality of virtually error-free (digitial) computing machines has become commonplace and threshold theorems are rarely discussed anymore these days.

This situation is different for quantum computing, where threshold theorems (proven by Knill, Laflamme & Zurek 1998) and Aharonov and Ben-Or 2008 are the basis for ongoing hopes that quantum error correction technology can achieve scalable useful quantum computers even with near-term available noisy qbits and noisy quantum logic gates (cf. NISQ).

References

For classical computing

For quantum comuting

For more see here at quantum error correction.

Original proofs of threshold theorems for various error-models in quantum computing:

following

Review:

  • Daniel Gottesman, ยง5 in: An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation, in: Quantum Information Science and Its Contributions to Mathematics, Proceedings of Symposia in Applied Mathematics 68 (2010) [arXiv:0904.2557, doi:10.1090/psapm/068]

Lecture notes:

  • Seth Lloyd: Fault Tolerant Quantum Computing, Lecture 14 in Quantum Computing (CST Part II) [pdf]

See also:

Created on March 3, 2025 at 15:50:41. See the history of this page for a list of all contributions to it.