Abstract

We have previously [11] shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error ffl provided each gate has error at most cffl. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other work. Methods are proposed to account for leakage errors, a problem not previously recognized. 1 Introduction Three recent events are promising to make extensive quantum computations as practical as classical computations. The first is the discovery by Shor [13], Steane [15] and Calderbank et al. [4, 3] of quantum error-correcting codes email: knill@lanl.gov y laflamme@lanl.gov z whz@lanl.gov which can be used to main...

Keywords

Computer scienceComputationAlgorithmMathematics

Related Publications

Fault-tolerant quantum computation

The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors...

1997 arXiv (Cornell University) 124 citations

Fault-tolerant quantum computation

It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been gr...

2002 Proceedings of 37th Conference on Fou... 861 citations

Publication Info

Year
1996
Type
article
Citations
71
Access
Closed

External Links

Citation Metrics

71
OpenAlex

Cite This

Emanuel Knill, Wojciech H. Zurek, Raymond Laflamme (1996). Accuracy threshold for quantum computation. .