Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Quantum Computing With Realistically Noisy Devices



Emanuel H. Knill


There are quantum algorithms that can efficiently simulate quantum physics, factor large numbers and estimate integrals. As a result, quantum computers can solve otherwise intractable computational problems. One of the main problems of experimental quantum computing is to preserve fragile quantum states in the presence of errors. It is known that if the needed elementary operations (gates) can be implemented with error probabilities below a threshold, then it is possible to efficiently quantum compute arbitrarily accurately. Here we give evidence that for independent errors, the theoretical threshold is well above 3 percent, a significant improvement over earlier calculations. However, the resources required at such high error probabilities are excessive. Fortunately, they decrease rapidly with decreasing error probabilities. If we had quantum resources comparable to the considerable resources available in today's digital computers, we could implement non-trivial quantum algorithms at error probabilities as high as 1 percent per gate.


fault-tolerance thresholds, fault-tolerant quantum computing, postselected quantum computing, quantum computing, quantum error-correcting codes, scalable quantum computing


Knill, E. (2005), Quantum Computing With Realistically Noisy Devices, Nature (Accessed July 23, 2024)


If you have any questions about this publication or are having problems accessing it, please contact

Created March 3, 2005, Updated February 17, 2017