Abstracts
Poster Abstracts | Talk Abstracts
Quantum supremacy using a programmable superconducting processor
Presenting Author: John Martinis, Google and University of California, Santa Barbara
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much-anticipated computing paradigm.
- Home
- Registration
- SQuInT
- Program
- Lodging and Transportation
- Conference Center Map (.pdf)
- Instructions for Presenters
- Bulletin Board
- Past SQuInT Meetings
SQuInT Chief Organizer
Akimasa Miyake, Associate Professor
amiyake@unm.edu
SQuInT Co-Organizer
Brian Smith, Associate Professor UO
bjsmith@uoregon.edu
SQuInT Program Committee
Postdoctoral Fellows:
Markus Allgaier (UO OMQ)
Sayonee Ray (UNM CQuIC)
Pablo Poggi (UNM CQuIC)
Valerian Thiel (UO OMQ)
SQuInT Event Co-Organizers (Oregon)
Jorjie Arden
jarden@uoregon.edu
Holly Lynn
hollylyn@uoregon.edu
Brandy Todd
SQuInT Administrator (CQuIC)
Gloria Cordova
gjcordo1@unm.edu
505 277-1850
SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director
ideutsch@unm.edu