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 error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
Cite
@article{arxiv.quant-ph/9702058,
title = {Resilient Quantum Computation: Error Models and Thresholds},
author = {Emanuel Knill and Raymond Laflamme and Wojciech H. Zurek},
journal= {arXiv preprint arXiv:quant-ph/9702058},
year = {2009}
}
Comments
19 pages in RevTex, many figures, the paper is also avalaible at http://qso.lanl.gov/qc/