- Frank Arute
- Kunal Arya
- Ryan Babbush
- Dave Bacon
- Joseph Bardin
- Rami Barends
- Rupak Biswas
- Sergio Boixo
- Fernando Brandao
- David Buell
- Brian Burkett
- Yu Chen
- Jimmy Chen
- Ben Chiaro
- Roberto Collins
- William Courtney
- Andrew Dunsworth
- Edward Farhi
- Brooks Foxen
- Austin Fowler
- Craig Michael Gidney
- Marissa Giustina
- Rob Graff
- Keith Guerin
- Steve Habegger
- Matthew Harrigan
- Michael Hartmann
- Alan Ho
- Markus Rudolf Hoffmann
- Trent Huang
- Travis Humble
- Sergei Isakov
- Evan Jeffrey
- Zhang Jiang
- Dvir Kafri
- Kostyantyn Kechedzhi
- Julian Kelly
- Paul Klimov
- Sergey Knysh
- Alexander Korotkov
- Fedor Kostritsa
- Dave Landhuis
- Mike Lindmark
- Erik Lucero
- Dmitry Lyakh
- Salvatore Mandrà
- Jarrod Ryan 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 Platt
- Chris Quintana
- Eleanor G. Rieffel
- Pedram Roushan
- Nicholas Rubin
- Daniel Sank
- Kevin J. Satzinger
- Vadim Smelyanskiy
- Kevin Jeffery Sung
- Matt Trevithick
- Amit Vainsencher
- Benjamin Villalonga
- Ted White
- Z. Jamie Yao
- Ping Yeh
- Adam Zalcman
- Hartmut Neven
- John Martinis
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. 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 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 2^53 (about 10^16). 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 for this specific computational task, heralding a much-anticipated computing paradigm.
Research Areas
Learn more about how we do research
We maintain a portfolio of research projects, providing individuals and teams the freedom to emphasize specific types of work