Accuracy threshold for quantum computation
Emanuel H. Knill, Wojciech Hubert Zurek, Raymond Laflamme · 1996
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: [email protected] y [email protected] z [email protected] which can be used to main...