CERN Accelerating science

Talk
Title Quantum Computational Supremacy and Its Applications
Video
Loading
If you experience any problem watching the video, click the download button below
Download Embed
Mp4:Medium
(800 kbps)
High
(2000 kbps)
More..
Copy-paste this code into your page:
Author(s) Aaronson , Scott (speaker) (UT Austin, US)
Corporate author(s) CERN. Geneva
Imprint 2020-07-30. - 1:28:13.
Series (CERN Colloquium)
Lecture note on 2020-07-30T16:30:00
Subject category CERN Colloquium
Abstract

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 that I've been developing for Google's experiment: namely, the generation of trusted public random bits, for use (for example) in cryptocurrencies.

Password: 261165

Copyright/License © 2020-2024 CERN
Submitted by claudia.dupraz@cern.ch

 


 Record created 2020-08-07, last modified 2022-11-02


External link:
Download fulltext
Event details