Quantum threshold theorem

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In quantum computing, the (quantum) threshold theorem (or quantum fault-tolerance theorem), proved by Michael Ben-Or and Dorit Aharonov (along with other groups),[who?] states that a quantum computer with a physical error rate below a certain threshold can, through application of Quantum error correction schemes, suppress the logical error rate to arbitrarily low levels. Current estimates put the threshold for the surface code on the order of 1%,[1] though estimates range widely and are difficult to calculate due to the exponential difficulty of simulating large quantum systems. At a 0.1% probability of a depolarizing error, the surface code would require approximately 1,000-10,000 physical qubits per logical data qubit[2], though more pathological error types could change this figure drastically.

See also[edit]


  1. ^ Fowler, Austin G.; Stephens, Ashley M.; Groszkowski, Peter (2009-11-11). "High-threshold universal quantum computation on the surface code". Physical Review A. 80 (5). arXiv:0803.0272Freely accessible. Bibcode:2009PhRvA..80e2312F. doi:10.1103/physreva.80.052312. ISSN 1050-2947. 
  2. ^ Campbell, Earl T.; Terhal, Barbara M.; Vuillot, Christophe (2017-09-13). "Roads towards fault-tolerant universal quantum computation". Nature. 549 (7671): 172–179. Bibcode:2017Natur.549..172C. doi:10.1038/nature23460. ISSN 0028-0836. 


Papers from : https://journals.aps.org/

Papers from : https://arxiv.org/

External links[edit]