Quantum supremacy in a superconducting quantum processor

John M. Martinis

doi:10.1117/12.2603523

13 July 2021 Quantum supremacy in a superconducting quantum processor

John M. Martinis

Proceedings Volume 11844, Photonics for Quantum 2021; 118440D (2021) https://doi.org/10.1117/12.2603523
Event: Photonics for Quantum, 2021, Online Only

Abstract

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. We have used a programmable superconducting processor to create quantum states on 53 qubits, corresponding to a "parallel computation" of 10 million trillion states. For a simple algorithm, our Sycamore processor takes about 200 seconds to run a quantum circuit a million times - 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, heralding a much-anticipated computing paradigm.

Conference Presentation

Citation Download Citation

John M. Martinis "Quantum supremacy in a superconducting quantum processor", Proc. SPIE 11844, Photonics for Quantum 2021, 118440D (13 July 2021); https://doi.org/10.1117/12.2603523

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available