Resilient quantum computation: error models and thresholds
Abstract
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum errorcorrection, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
 Publication:

Proceedings of the Royal Society of London Series A
 Pub Date:
 January 1998
 DOI:
 10.1098/rspa.1998.0166
 arXiv:
 arXiv:quantph/9702058
 Bibcode:
 1998RSPSA.454..365K
 Keywords:

 Quantum Physics
 EPrint:
 19 pages in RevTex, many figures, the paper is also avalaible at http://qso.lanl.gov/qc/