Back to Search Start Over

Quantum supremacy using a programmable superconducting processor.

Authors :
Arute F
Arya K
Babbush R
Bacon D
Bardin JC
Barends R
Biswas R
Boixo S
Brandao FGSL
Buell DA
Burkett B
Chen Y
Chen Z
Chiaro B
Collins R
Courtney W
Dunsworth A
Farhi E
Foxen B
Fowler A
Gidney C
Giustina M
Graff R
Guerin K
Habegger S
Harrigan MP
Hartmann MJ
Ho A
Hoffmann M
Huang T
Humble TS
Isakov SV
Jeffrey E
Jiang Z
Kafri D
Kechedzhi K
Kelly J
Klimov PV
Knysh S
Korotkov A
Kostritsa F
Landhuis D
Lindmark M
Lucero E
Lyakh D
MandrĂ  S
McClean JR
McEwen M
Megrant A
Mi X
Michielsen K
Mohseni M
Mutus J
Naaman O
Neeley M
Neill C
Niu MY
Ostby E
Petukhov A
Platt JC
Quintana C
Rieffel EG
Roushan P
Rubin NC
Sank D
Satzinger KJ
Smelyanskiy V
Sung KJ
Trevithick MD
Vainsencher A
Villalonga B
White T
Yao ZJ
Yeh P
Zalcman A
Neven H
Martinis JM
Source :
Nature [Nature] 2019 Oct; Vol. 574 (7779), pp. 505-510. Date of Electronic Publication: 2019 Oct 23.
Publication Year :
2019

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 <superscript>1</superscript> . 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 <superscript>2-7</superscript> to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2 <superscript>53</superscript> (about 10 <superscript>16</superscript> ). 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 <superscript>8-14</superscript> for this specific computational task, heralding a much-anticipated computing paradigm.

Details

Language :
English
ISSN :
1476-4687
Volume :
574
Issue :
7779
Database :
MEDLINE
Journal :
Nature
Publication Type :
Academic Journal
Accession number :
31645734
Full Text :
https://doi.org/10.1038/s41586-019-1666-5