Twitter: 
Facebook: 
Google+: 
Here are the details of the next Q+ hangout. To watch live, visit this link at the appointed hour.
Date/time: Tue. May 20th 2014 2pm BST/UTC+1
Speaker: Daniel Gottesman (Perimeter Institute)
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.
To keep up to date on the latest news about Q+ hangouts you can follow us on:
- Google+: http://gplus.to/qplus
- Twitter: @qplushangouts
- Facebook: http://facebook.com/qplushangouts
or visit our website.