Scott Aaronson - Quantum Computational Supremacy

April 23, 2021

3:45PM - 4:45PM

Zoom

Add to Calendar 2021-04-23 15:45:00 2021-04-23 16:45:00 Scott Aaronson - Quantum Computational Supremacy Frontiers in Quantum Information Science & Engineering Webinar Series Title: Quantum Computational Supremacy Scott Aaronson, David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin Zoom link: https://osu.zoom.us/j/92124527838?pwd=eTUwem96TDN6VXRwU0Q4OTF6VDMvZz09 Webinar ID: 921 2452 7838 Password: 117267 Abstract: In Fall 2019, a team at Google made the first-ever claim 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 Fall 2020, a group at USTC in China made a claim of quantum supremacy, using “BosonSampling” (a proposal by me and Alex Arkhipov in 2011) with 50-70 photons in an optical network. In addition to engineering, these accomplishments built on a decade of research in quantum complexity theory. This talk will discuss questions like: what exactly were the contrived computational problems that were solved? How does one verify the outputs using a classical computer? And how sure are we that the problems are indeed classically hard? I’ll end with a proposed application for these sampling-based quantum supremacy experiments—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 working to demonstrate. More About Scott Aaronson: 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 Faculty Fellowship, the Tomassoni-Chisesi Prize in Physics, and the ACM Prize in Computing, and is a Fellow of the ACM. Watch the recorded webinar here SUBSCRIBE to our email list here. If you require an accommodation such as live captioning or interpretation to participate in this event, please contact Jessi Middleton at middleton.85@osu.edu. Requests made five business day prior to the event will generally allow us to provide seamless access, but the university will make every effort to meet requests made after this date. Zoom OSU ASC Drupal 8 ascwebservices@osu.edu America/New_York public

Add to Calendar 2021-04-23 15:45:00 2021-04-23 16:45:00 Scott Aaronson - Quantum Computational Supremacy Frontiers in Quantum Information Science & Engineering Webinar Series   Title: Quantum Computational Supremacy   Scott Aaronson, David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin   Zoom link: https://osu.zoom.us/j/92124527838?pwd=eTUwem96TDN6VXRwU0Q4OTF6VDMvZz09 Webinar ID: 921 2452 7838 Password: 117267   Abstract:  In Fall 2019, a team at Google made the first-ever claim 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 Fall 2020, a group at USTC in China made a claim of quantum supremacy, using “BosonSampling” (a proposal by me and Alex Arkhipov in 2011) with 50-70 photons in an optical network.  In addition to engineering, these accomplishments built on a decade of research in quantum complexity theory.  This talk will discuss questions like: what exactly were the contrived computational problems that were solved?  How does one verify the outputs using a classical computer?  And how sure are we that the problems are indeed classically hard?  I’ll end with a proposed application for these sampling-based quantum supremacy experiments—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 working to demonstrate.   More About Scott Aaronson: 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 Faculty Fellowship, the Tomassoni-Chisesi Prize in Physics, and the ACM Prize in Computing, and is a Fellow of the ACM.   Watch the recorded webinar here   SUBSCRIBE to our email list here.   If you require an accommodation such as live captioning or interpretation to participate in this event, please contact Jessi Middleton at middleton.85@osu.edu. Requests made five business day prior to the event will generally allow us to provide seamless access, but the university will make every effort to meet requests made after this date. Zoom Institute for Optical Science spectroscopy@osu.edu America/New_York public

Frontiers in Quantum Information Science & Engineering Webinar Series

Title: Quantum Computational Supremacy

Scott Aaronson, David J. Bruton Centennial Professor of Computer Science, University of Texas at Austin

Zoom link: https://osu.zoom.us/j/92124527838?pwd=eTUwem96TDN6VXRwU0Q4OTF6VDMvZz09

Webinar ID: 921 2452 7838
Password: 117267

Abstract: In Fall 2019, a team at Google made the first-ever claim 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 Fall 2020, a group at USTC in China made a claim of quantum supremacy, using “BosonSampling” (a proposal by me and Alex Arkhipov in 2011) with 50-70 photons in an optical network. In addition to engineering, these accomplishments built on a decade of research in quantum complexity theory. This talk will discuss questions like: what exactly were the contrived computational problems that were solved? How does one verify the outputs using a classical computer? And how sure are we that the problems are indeed classically hard? I’ll end with a proposed application for these sampling-based quantum supremacy experiments—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 working to demonstrate.

More About Scott Aaronson:

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 Faculty Fellowship, the Tomassoni-Chisesi Prize in Physics, and the ACM Prize in Computing, and is a Fellow of the ACM.

Watch the recorded webinar here

SUBSCRIBE to our email list here.

If you require an accommodation such as live captioning or interpretation to participate in this event, please contact Jessi Middleton at middleton.85@osu.edu. Requests made five business day prior to the event will generally allow us to provide seamless access, but the university will make every effort to meet requests made after this date.