About
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 .
0:08:49 Slide 1
0:17:38 Slide 2
0:26:27 Slide 3
0:35:17 Slide 4
0:44:06 Slide 5
0:52:55 Slide 6
1:01:45 Slide 7
1:10:34 Slide 8
1:19:23 Slide 9
1:28:13 Slide 10
The talk
Credits and licence
- Institution
- CERN
- Department
- CERN Colloquium
- Speaker
- Scott Aaronson
- Year
- 2020
- Language
- English
- Subjects
- Physics
- Source
- CERN
- Licence
- CERN, as CERN states it. CERN's terms
- Attribution
- © CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
- Who can watch
- CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed