Cargando…
Quantum Computational Supremacy and Its Applications
<!--HTML--><p><span><span>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...
Autor principal: | |
---|---|
Lenguaje: | eng |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/2727245 |
_version_ | 1780966296289017856 |
---|---|
author | Aaronson , Scott |
author_facet | Aaronson , Scott |
author_sort | Aaronson , Scott |
collection | CERN |
description | <!--HTML--><p><span><span>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.</span></span></p>
<p><em>Password: 261165</em></p> |
id | cern-2727245 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 2020 |
record_format | invenio |
spelling | cern-27272452022-11-02T22:19:31Zhttp://cds.cern.ch/record/2727245engAaronson , ScottQuantum Computational Supremacy and Its ApplicationsQuantum Computational Supremacy and Its ApplicationsCERN Colloquium<!--HTML--><p><span><span>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.</span></span></p> <p><em>Password: 261165</em></p>oai:cds.cern.ch:27272452020 |
spellingShingle | CERN Colloquium Aaronson , Scott Quantum Computational Supremacy and Its Applications |
title | Quantum Computational Supremacy and Its Applications |
title_full | Quantum Computational Supremacy and Its Applications |
title_fullStr | Quantum Computational Supremacy and Its Applications |
title_full_unstemmed | Quantum Computational Supremacy and Its Applications |
title_short | Quantum Computational Supremacy and Its Applications |
title_sort | quantum computational supremacy and its applications |
topic | CERN Colloquium |
url | http://cds.cern.ch/record/2727245 |
work_keys_str_mv | AT aaronsonscott quantumcomputationalsupremacyanditsapplications |