arXiv:1310.2984quant-ph
Fault-Tolerant Quantum Computation with Constant Overhead
Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
Abstract
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.
There is an extremely broad range of scaling between linear and exponential… Even in architectures with nearest neighbor gates, the (multiplicative) overhead stemming from error correction will only need to be logarithmic in the size of the computation. The constants may be…
s1devView on HNParent context