Construct · 1 fields · 1 citations

quantum threshold theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
quantumthreshold theorem1 CONSTRUCTQuantum thresholdAHARONOV · QUANTUM COMPUTING

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Quantum computing

the result that quantum computations of any length can be run reliably if the error rate per gate is below a constant threshold.

In quantum computing, quantum threshold theorem refers to the result that quantum computations of any length can be run reliably if the error rate per gate is below a constant threshold. This meaning comes from Aharonov (1997) in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how quantum threshold theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

constant2 fields · 2 citationsjingle · one word, two constructserror4 fields · 8 citationsjingle · one word, four constructsgate5 fields · 6 citationsjingle · one word, five constructs

References

  1. Aharonov, D., & Ben-Or, M. (1997). Fault-tolerant quantum computation with constant error. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97. https://doi.org/10.1145/258533.258579

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct