Threshold theorem
Quantum error correction schemes can suppress the logical error rate arbitrarily low / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Threshold theorem?
Summarize this article for a 10 year old
In quantum computing, the threshold theorem (or quantum fault-tolerance theorem) 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. This shows that quantum computers can be made fault-tolerant, as an analogue to von Neumann's threshold theorem for classical computation.[1] This result was proven (for various error models) by the groups of Dorit Aharanov and Michael Ben-Or;[2] Emanuel Knill, Raymond Laflamme, and Wojciech Zurek;[3] and Alexei Kitaev[4] independently.[3] These results built on a paper of Peter Shor,[5] which proved a weaker version of the threshold theorem.