 Quantum supremacy using a programmable superconducting processorFrank Arute,
Kunal Arya,
Ryan Babbush,
Dave Bacon,
Joseph C. Bardin,
Rami Barends,
Rupak Biswas,
Sergio Boixo,
Fernando G. S. L. Brandao,
David A. Buell,
Brian Burkett,
Yu Chen,
Zijun Chen,
Ben Chiaro,
Roberto Collins,
William Courtney,
Andrew Dunsworth,
Edward Farhi,
Brooks Foxen,
Austin Fowler,
Craig Gidney,
Marissa Giustina,
Rob Graff,
Keith Guerin,
Steve Habegger,
Matthew P. Harrigan,
Michael J. Hartmann,
Alan Ho,
Markus Hoffmann,
Trent Huang,
Travis S. Humble,
Sergei V. Isakov,
Evan Jeffrey,
Zhang Jiang,
Dvir Kafri,
Kostyantyn Kechedzhi,
Julian Kelly,
Paul V. Klimov,
Sergey Knysh,
Alexander Korotkov,
Fedor Kostritsa,
David Landhuis,
Mike Lindmark,
Erik Lucero,
Dmitry Lyakh,
Salvatore Mandrà,
Jarrod R. McClean,
Matthew McEwen,
Anthony Megrant,
Xiao Mi,
Kristel Michielsen,
Masoud Mohseni,
Josh Mutus,
Ofer Naaman,
Matthew Neeley,
Charles Neill,
Murphy Yuezhen Niu,
Eric Ostby,
Andre Petukhov,
John C. Platt,
Chris Quintana,
Eleanor G. Rieffel,
Pedram Roushan,
Nicholas C. Rubin,
Daniel Sank,
Kevin J. Satzinger,
Vadim Smelyanskiy,
Kevin J. Sung,
Matthew D. Trevithick,
Amit Vainsencher,
Benjamin Villalonga,
Theodore White,
Z. Jamie Yao,
Ping Yeh,
Adam Zalcman,
Hartmut Neven and
John M. Martinis ()
Nature, 2019, vol. 574, issue 7779, 505-510 Abstract: Abstract 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. Date: 2019 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:574:y:2019:i:7779:d:10.1038_s41586-019-1666-5 Ordering information: This journal article can be ordered from DOI: 10.1038/s41586-019-1666-5 Access Statistics for this article Nature is currently edited by Magdalena Skipper More articles in Nature from Nature |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.