Fibonacci schemes of fault-tolerant quantum computation
Panos Aliferis
TL;DR
This paper addresses errors in previous threshold estimates for fault-tolerant quantum computation and discusses a corrected proof, emphasizing the importance of accurate fault-tolerance thresholds.
Contribution
It clarifies the flaw in earlier estimates and presents a new, corrected proof for fault-tolerance thresholds in quantum computing.
Findings
Previous threshold estimates were incorrect
A new proof for fault-tolerance thresholds is provided
Highlights the importance of rigorous proofs in quantum fault tolerance
Abstract
The threshold estimate derived in previous versions of this paper was incorrect; this note explains the flaw. A new proof is discussed in arXiv:0809.5063.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications