PIRSA:14070004

Fault-Tolerant Quantum Computation with Constant Overhead

Gottesman, D. (2014). Fault-Tolerant Quantum Computation with Constant Overhead. Perimeter Institute. https://pirsa.org/14070004

Gottesman, Daniel. Fault-Tolerant Quantum Computation with Constant Overhead. Perimeter Institute, Jul. 14, 2014, https://pirsa.org/14070004 

          @misc{ pirsa_PIRSA:14070004,
            doi = {10.48660/14070004},
            url = {https://pirsa.org/14070004},
            author = {Gottesman, Daniel},
            keywords = {},
            language = {en},
            title = {Fault-Tolerant Quantum Computation with Constant Overhead},
            publisher = {Perimeter Institute},
            year = {2014},
            month = {jul},
            note = {PIRSA:14070004 see, \url{https://pirsa.org}}
          }

Daniel Gottesman

University of Maryland, College Park

Talk number
PIRSA:14070004
Collection
Talk Type
Abstract
The threshold theorem for fault tolerance tells us that it is possible to build arbitrarily large reliable quantum computers provided the error rate per physical gate or time step is below some threshold value. Most research on the threshold theorem so far has gone into optimizing the tolerable error rate under various assumptions, with other considerations being secondary. However, for the foreseeable future, the number of qubits may be an even greater restriction than error rates. The overhead, the ratio of physical qubits to logical qubits, determines how expensive (in qubits) a fault-tolerant computation is. Earlier results on fault tolerance used a large overhead which grows (albeit slowly) with the size of the computation. I show that using quantum LDPC codes, it is possible in principle to do fault-tolerant quantum computation with low overhead, and with the overhead constant in the size of the computation.