Quantum Computational Supremacy and Its Applications
David J. Bruton Centennial Professor of Computer Science
Last fall, a team at Google announced the first-ever demonstration of "quantum computational
supremacy"---that is, a clear quantum speedup over a classical computer for some task--
using a 53-qubit programmable superconducting chip called Sycamore. Google's accomplishment
drew on a decade of research in my field of quantum complexity theory. This talk will
discuss questions like: what exactly was the (contrived) problem that Sycamore solved?
How does one verify the outputs using a classical computer? And how confident are
we that the problem is classically hard---especially in light of subsequent counterclaims
by IBM and others? I'll end with a possible application for Google's experiment---namely,
the generation of
trusted public random bits, for use (for example) in cryptocurrencies---that I've been developing and that Google and NIST are now working to test.
Scott Aaronson is David J. Bruton Centennial Professor of Computer Science at the University of Texas at Austin. He received his bachelor's from Cornell University and his PhD from UC Berkeley. Before coming to UT Austin, he spent nine years as a professor in Electrical Engineering and Computer Science at MIT. Aaronson's research in theoretical computer science has focused mainly on the capabilities and limits of quantum computers. His first book, Quantum Computing Since Democritus, was published in 2013 by Cambridge University Press. He received the National Science Foundation's Alan T. Waterman Award, the United States PECASE Award, and the Tomassoni-Chisesi Prize in Physics.