arrow
Return

Quantum supremacy using a programmable superconducting processor

delete2019-10-23
delete0
PRE
AI
F
Frank Arute
K
Kunal Arya
R
Ryan Babbush
D
Dave Bacon
J
Joseph C. Bardin
R
Rami Barends
R
Rupak Biswas
S
Sergio Boixo
F
Fernando G. S. L. Brandao
D
David A. Buell
B
Brian Burkett
Y
Yu Chen
Z
Zijun Chen
B
Ben Chiaro
R
Roberto Collins
W
William Courtney
A
Andrew Dunsworth
E
Edward Farhi
B
Brooks Foxen
A
Austin Fowler
C
Craig Gidney
M
Marissa Giustina
R
Rob Graff
K
Keith Guerin
S
Steve Habegger
M
Matthew P. Harrigan
M
Michael J. Hartmann
A
Alan Ho
M
Markus Hoffmann
T
Trent Huang
T
Travis S. Humble
S
Sergei V. Isakov
E
Evan Jeffrey
Z
Zhang Jiang
D
Dvir Kafri
K
Kostyantyn Kechedzhi
J
Julian Kelly
P
Paul V. Klimov
S
Sergey Knysh
A
Alexander Korotkov
F
Fedor Kostritsa
D
David Landhuis
M
Mike Lindmark
E
Erik Lucero
D
Dmitry Lyakh
S
Salvatore Mandrà
J
Jarrod R. McClean
M
Matthew McEwen
A
Anthony Megrant
X
Xiao Mi
K
Kristel Michielsen
M
Masoud Mohseni
J
Josh Mutus
O
Ofer Naaman
M
Matthew Neeley
C
Charles Neill
M
Murphy Yuezhen Niu
E
Eric Ostby
A
Andre Petukhov
J
John C. Platt
C
Chris Quintana
E
Eleanor G. Rieffel
P
Pedram Roushan
N
Nicholas C. Rubin
D
Daniel Sank
K
Kevin J. Satzinger
V
Vadim Smelyanskiy
K
Kevin J. Sung
M
Matthew D. Trevithick
A
Amit Vainsencher
B
Benjamin Villalonga
T
Theodore White
Z
Z. Jamie Yao
P
Ping Yeh
A
Adam Zalcman
H
Hartmut Neven
J
John M. Martinis *
DOI:10.1038/s41586-019-1666-5delete
deleteOriginal
deleteShare
deleteSave
Abstract

Abstract

En 中文
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. 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 qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). 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 supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Journal

Nature cover
Nature
IF:
48.5
Papers:
3.6W
Citations:
110.8W

Organization

N
nasa-ames research center
Scholars:
5
Papers: 4
Citations: 0
F
Forschungszentrum Julich
Scholars:
626
Papers: 202
Citations: 291
G
google ai quantum
Scholars:
70
Papers: 1
Citations: 0
O
oak ridge national laboratory
Scholars:
1.7K
Papers: 628
Citations: 1.1W
U
university of california
Scholars:
1.3W
Papers: 4.4K
Citations: 4.4K
researcher View more organizations
Cited Papers

Cited Papers

Resolving photon number states in a superconducting circuit
err2007-02-01
err0
PREAI
errD. I. Schuster; A. A. Houck; J. A. Schreier; A. Wallraff; J. M. Gambetta; A. Blais; L. Frunzio; J. Majer; B. Johnson; M. H. Devoret; S. M. Girvin; R. J. Schoelkopf
errShare
errSave
errShare
errSave
Quantum Simulations of Classical Annealing Processes
err2008-09-26
err0
errOAAI
errR. D. Somma; S. Boixo; H. Barnum; E. Knill
errShare
errSave
Qubit Architecture with High Coherence and Fast Tunable Coupling
err2014-11-26
err0
errOAAI
errYu Chen; C. Neill; P. Roushan; N. Leung; M. Fang; R. Barends; J. Kelly; B. Campbell; Z. Chen; B. Chiaro; A. Dunsworth; E. Jeffrey; A. Megrant; J. Y. Mutus; P. J. J. O’Malley; C. M. Quintana; D. Sank; A. Vainsencher; J. Wenner; T. C. White; Michael R. Geller; A. N. Cleland; John M. Martinis
errShare
errSave
A variational eigenvalue solver on a photonic quantum processor
err2014-07-23
err2.7K
errOAAI
errPeruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alan; O'Brien, Jeremy L.
errShare
errSave
Barren plateaus in quantum neural network training landscapes
err2018-11-16
err1.1K
errOAAI
errMcClean, Jarrod R.; Boixo, Sergio; Smelyanskiy, Vadim N.; Babbush, Ryan; Neven, Hartmut
errShare
errSave
Characterizing quantum supremacy in near-term devices
err2018-04-23
err762
errOAAI
errBoixo, Sergio; Isakov, Sergei, V; Smelyanskiy, Vadim N.; Babbush, Ryan; Ding, Nan; Jiang, Zhang; Bremner, Michael J.; Martinis, John M.; Neven, Hartmut
errShare
errSave
researcher View more