arXiv Analytics

Sign in

arXiv:1310.2984 [quant-ph]AbstractReferencesReviewsResources

Fault-Tolerant Quantum Computation with Constant Overhead

Daniel Gottesman

Published 2013-10-10, updated 2014-07-22Version 3

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.

Comments: 32 pages. v2 has new title, discussion of hyperbolic codes, other minor edits. v3 has additional corrections and clarifications
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0610117 (Published 2006-10-14)
Is Fault-Tolerant Quantum Computation Really Possible?
arXiv:quant-ph/0610082 (Published 2006-10-11, updated 2007-05-14)
Fault-tolerant quantum computation with high threshold in two dimensions
arXiv:quant-ph/9702029 (Published 1997-02-12, updated 1997-02-18)
A Theory of Fault-Tolerant Quantum Computation