### Q+

Shared publicly -We'd like to announce the next Q+ hangout. As usual, please leave a comment below if you would like to join the hangout itself. Everyone else can watch on the livestream.

Title: Fault-tolerant quantum computation with constant overhead

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 even larger (albeit slowly) with the size of the computation. I show that it is possible in principle to do fault-tolerant quantum computation with the overhead constant in the size of the computation, and with a low constant at that. The result depends on recent progress on quantum low-density parity check codes.

Title: Fault-tolerant quantum computation with constant overhead

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 even larger (albeit slowly) with the size of the computation. I show that it is possible in principle to do fault-tolerant quantum computation with the overhead constant in the size of the computation, and with a low constant at that. The result depends on recent progress on quantum low-density parity check codes.

This Hangout On Air is hosted by Q+. The live video broadcast will begin soon.

Q&A

Preview

Live

Q+ Hangout: Daniel Gottesman (Perimeter Institute)

Tue, May 20, 9:00 AM

Hangouts On Air

3

4

8 comments

+Chris Richardson, OK you are in for now, but if we get oversubscribed and you are not there 5min before the talk then I will reopen your seat.

Add a comment...