Reichardt, Ben W. (2009) Error-Detection-Based Quantum Fault-Tolerance Threshold. Algorithmica, 55 (3). pp. 517-556. ISSN 0178-4617 http://resolver.caltech.edu/CaltechAUTHORS:20090910-085348841
- Published Version
Restricted to Repository administrators only
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20090910-085348841
A major hurdle in building a quantum computer is overcoming noise, since quantum superpositions are fragile. Developed over the last couple of years, schemes for achieving fault tolerance based on error detection, rather than error correction, appear to tolerate as much as 3–6% noise per gate—an order of magnitude higher than previous procedures. However, proof techniques could not show that these promising fault-tolerance schemes tolerated any noise at all; the distribution of errors in the quantum state has correlations that conceivably could grow out of control. With an analysis based on decomposing complicated probability distributions into mixtures of simpler ones, we rigorously prove the existence of constant tolerable noise rates (“noise thresholds”) for error-detection-based schemes. Numerical calculations indicate that the actual noise threshold this method yields is lower-bounded by 0.1% noise per gate.
|Additional Information:||© 2009 Springer. Received: 16 March 2007. Accepted: 10 September 2007. Published online: 17 October 2007. The author thanks Umesh Vazirani for many helpful discussions. Work conducted while at the University of California, Berkeley, supported in part by NSF ITR Grant CCR-0121555 and ARO Grant DAAD 19-03-1-0082.|
|Subject Keywords:||Quantum fault tolerance; Noise threshold; Error detection; Postselection|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||George Porter|
|Deposited On:||14 Sep 2009 20:42|
|Last Modified:||26 Dec 2012 11:20|
Repository Staff Only: item control page