Private Event
HotTopics: Quantum Computational Supremacy and Its Applications
Speaker
Prof. Scott Aaronson
The University of Texas at Austin
Host
Daniela Rus
CSAIL
Abstract:
This 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. In addition to the engineering accomplishment, Google's experiment built on a decade of research in quantum complexity theory, some of which we did at MIT with students including Alex Arkhipov and Lijie Chen. This talk will discuss questions like: what exactly was the contrived problem that Google 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? I'll end with a proposed application for Google's experiment---namely, the generation of certified random bits, for use (for example) in proof-of-stake cryptocurrencies---that I've been developing and that Google is now working to demonstrate.
Bio:
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, the Vannevar Bush Fellowship, the Tomassoni-Chisesi Prize in Physics, and MIT's Junior Bose Award for Excellence in Teaching.
Light refreshments will be served at 3:45pm
This 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. In addition to the engineering accomplishment, Google's experiment built on a decade of research in quantum complexity theory, some of which we did at MIT with students including Alex Arkhipov and Lijie Chen. This talk will discuss questions like: what exactly was the contrived problem that Google 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? I'll end with a proposed application for Google's experiment---namely, the generation of certified random bits, for use (for example) in proof-of-stake cryptocurrencies---that I've been developing and that Google is now working to demonstrate.
Bio:
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, the Vannevar Bush Fellowship, the Tomassoni-Chisesi Prize in Physics, and MIT's Junior Bose Award for Excellence in Teaching.
Light refreshments will be served at 3:45pm