Quantum supremacy using a programmable superconducting processor

Квантовое превосходство с использованием программируемого сверхпроводящего процессора
Yu Chen, Paul V. Klimov, Craig Gidney, Ofer Naaman, Frank 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, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, Austin Fowler, 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, 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, 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, John M. Martinis
2019-10-23

53 qubitsSycamore processorprogrammable superconducting qubitsquantum supremacysampling quantum circuits
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.
1
A programmable superconducting processor (Sycamore) created quantum states on 53 qubits, accessing a state-space of dimension 2^53 (~10^16).
2
Authors estimate an equivalent task on a state-of-the-art classical supercomputer would take approximately 10,000 years.
3
Repeated measurements sample the processor's output probability distribution, which was verified against classical simulations.
4
Sycamore took about 200 seconds to generate one instance of a quantum circuit sampled one million times.
5
This experiment constitutes an experimental realization of quantum supremacy for the specific sampling task demonstrated.

Programmable superconducting quantum processor (Sycamore) with 53 qubits

Demonstration of quantum supremacy via sampling the output probability distribution of random quantum circuits on the 53-qubit processor and benchmarking its sampling runtime against classical supercomputers

Publication Details
Publication Date
2019-10-23
Journal
Publisher
ISSN
Access Type
Author Information
Authors
Yu Chen
Paul V. Klimov
Craig Gidney
Ofer Naaman
Frank 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
Zijun Chen
Ben Chiaro
Roberto Collins
William Courtney
Andrew Dunsworth
Edward Farhi
Brooks Foxen
Austin Fowler
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
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
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
John M. Martinis
Explore further
Open the scid.ai AI chat with a ready-made request: it will find papers on a similar topic and help build a literature review.
Find similar papers in the chat
Make a presentation
100%