Characterizing quantum supremacy in near-term devices
Sergio Boixo,Sergei V. Isakov,Vadim Smelyanskiy,Ryan Babbush,Nan Ding,Zhang Jiang,Michael J. Bremner,John M. Martinis,John M. Martinis,Hartmut Neven +9 more
TLDR
In this paper, the authors proposed the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy and showed that this sampling task must take exponential time in a classical computer.Abstract:
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of supercomputers. Such a demonstration of what is referred to as quantum supremacy requires a reliable evaluation of the resources required to solve tasks with classical approaches. Here, we propose the task of sampling from the output distribution of random quantum circuits as a demonstration of quantum supremacy. We extend previous results in computational complexity to argue that this sampling task must take exponential time in a classical computer. We introduce cross-entropy benchmarking to obtain the experimental fidelity of complex multiqubit dynamics. This can be estimated and extrapolated to give a success metric for a quantum supremacy demonstration. We study the computational cost of relevant classical algorithms and conclude that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles. This requires an error rate of around 0.5% for two-qubit gates (0.05% for one-qubit gates), and it would demonstrate the basic building blocks for a fault-tolerant quantum computer. As a benchmark for the development of a future quantum computer, sampling from random quantum circuits is suggested as a task that will lead to quantum supremacy—a calculation that cannot be carried out classically.read more
Citations
More filters
Journal ArticleDOI
Supplementary information for "Quantum supremacy using a programmable superconducting processor"
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Alan Ho,Markus R. 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 N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,Erik Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt 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 Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis +76 more
TL;DR: In this paper, an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature, is presented.
Journal ArticleDOI
Quantum Computing in the NISQ era and beyond
TL;DR: Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future as mentioned in this paper, which will be useful tools for exploring many-body quantum physics, and may have other useful applications.
Journal ArticleDOI
Quantum Computing in the NISQ era and beyond
TL;DR: Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away - but it should be regarded as a significant step toward the more powerful quantum technologies of the future.
Journal ArticleDOI
Quantum supremacy using a programmable superconducting processor
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Michael J. Hartmann,Alan Ho,Markus R. 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 N. Korotkov,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,E. Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt McEwen,Anthony Megrant,Xiao Mi,Kristel Michielsen,Kristel Michielsen,Masoud Mohseni,Josh Mutus,Ofer Naaman,Matthew Neeley,Charles Neill,Murphy Yuezhen Niu,Eric Ostby,Andre Petukhov,John Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin J. Sung,Kevin J. Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis,John M. Martinis +85 more
TL;DR: 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 ArticleDOI
Barren Plateaus in Quantum Neural Network Training Landscapes
TL;DR: In this article, the authors show that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits.
References
More filters
Journal ArticleDOI
Surface codes: Towards practical large-scale quantum computation
TL;DR: The concept of the stabilizer, using two qubits, is introduced, and the single-qubit Hadamard, S and T operators are described, completing the set of required gates for a universal quantum computer.
Journal ArticleDOI
Random-matrix theory of quantum transport
TL;DR: In this article, a review of the statistical properties of the scattering matrix of a mesoscopic system is presented, where two geometries are contrasted: a quantum dot and a disordered wire.
Journal ArticleDOI
Superconducting quantum circuits at the surface code threshold for fault tolerance
Rami Barends,Julian Kelly,A. Megrant,Andrzej Veitia,Daniel Sank,Evan Jeffrey,Ted White,Josh Mutus,Austin G. Fowler,Brooks Campbell,Yu Chen,Zijun Chen,Benjamin Chiaro,Andrew Dunsworth,Charles Neill,Peter O'Malley,Pedram Roushan,Amit Vainsencher,James Wenner,Alexander N. Korotkov,Andrew Cleland,John M. Martinis +21 more
TL;DR: The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
Journal ArticleDOI
State preservation by repetitive error detection in a superconducting quantum circuit
Julian Kelly,Rami Barends,Austin G. Fowler,A. Megrant,Evan Jeffrey,Ted White,Daniel Sank,Josh Mutus,Brooks Campbell,Yu Chen,Zijun Chen,Benjamin Chiaro,Andrew Dunsworth,Io-Chun Hoi,Charles Neill,Peter O'Malley,Chris Quintana,Pedram Roushan,Amit Vainsencher,James Wenner,Andrew Cleland,John M. Martinis +21 more
TL;DR: The protection of classical states from environmental bit-flip errors is reported and the suppression of these errors with increasing system size is demonstrated, motivating further research into the many challenges associated with building a large-scale superconducting quantum computer.
Journal ArticleDOI
Fluctuations of Nuclear Reaction Widths
Charles E. Porter,R. G. Thomas +1 more
TL;DR: In this paper, the fluctuations of the neutron reduced widths from the resonance region of intermediate and heavy nuclei have been analyzed by a statistical procedure which is based on the method of maximum likelihood.
Related Papers (5)
Quantum supremacy using a programmable superconducting processor
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Michael J. Hartmann,Alan Ho,Markus R. 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 N. Korotkov,Alexander N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,E. Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt McEwen,Anthony Megrant,Xiao Mi,Kristel Michielsen,Kristel Michielsen,Masoud Mohseni,Josh Mutus,Ofer Naaman,Matthew Neeley,Charles Neill,Murphy Yuezhen Niu,Eric Ostby,Andre Petukhov,John Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin J. Sung,Kevin J. Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis,John M. Martinis +85 more
Supplementary information for "Quantum supremacy using a programmable superconducting processor"
Frank Arute,Kunal Arya,Ryan Babbush,Dave Bacon,Joseph C. Bardin,Rami Barends,Rupak Biswas,Sergio Boixo,Fernando G. S. L. Brandão,David A. Buell,B. Burkett,Yu Chen,Zijun Chen,Ben Chiaro,Roberto Collins,William Courtney,Andrew Dunsworth,Edward Farhi,Brooks Foxen,Austin G. Fowler,Craig Gidney,Marissa Giustina,R. Graff,Keith Guerin,Steve Habegger,Matthew P. Harrigan,Michael J. Hartmann,Alan Ho,Markus R. 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 N. Korotkov,Fedor Kostritsa,David Landhuis,Mike Lindmark,Erik Lucero,Dmitry I. Lyakh,Salvatore Mandrà,Jarrod R. McClean,Matt 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 Platt,Chris Quintana,Eleanor Rieffel,Pedram Roushan,Nicholas C. Rubin,Daniel Sank,Kevin J. Satzinger,Vadim Smelyanskiy,Kevin Sung,Matthew D. Trevithick,Amit Vainsencher,Benjamin Villalonga,Theodore White,Z. Jamie Yao,Ping Yeh,Adam Zalcman,Hartmut Neven,John M. Martinis +76 more