Quantum supremacy using a programmable superconducting processor

@article{Arute2019QuantumSU,
  title={Quantum supremacy using a programmable superconducting processor},
  author={Frank Arute and Kunal Arya and Ryan Babbush and Dave Bacon and Joseph C. Bardin and Rami Barends and Rupak Biswas and Sergio Boixo and Fernando G. S. L. Brand{\~a}o and David A. Buell and Brian Burkett and Yu Chen and Zijun Chen and Benjamin Chiaro and Roberto Collins and William Courtney and Andrew Dunsworth and Edward Farhi and Brooks Foxen and Austin G. Fowler and Craig Gidney and Marissa Giustina and Rob Graff and Keith Guerin and S. Habegger and Matthew P. Harrigan and Michael J. Hartmann and Alan K. Ho and Markus Hoffmann and Trent Huang and T. Humble and Sergei V. Isakov and Evan Jeffrey and Zhang Jiang and Dvir Kafri and Kostyantyn Kechedzhi and Julian Kelly and Paul V. Klimov and Sergey Knysh and Alexander N. Korotkov and Fedor Kostritsa and David Landhuis and Mike Lindmark and Erik Lucero and Dmitry I. Lyakh and Salvatore Mandr{\`a} and Jarrod R. McClean and Matthew J. McEwen and Anthony Megrant and Xiao Mi and Kristel Michielsen and Masoud Mohseni and Josh Mutus and Ofer Naaman and Matthew Neeley and Charles J. Neill and Murphy Yuezhen Niu and Eric P. Ostby and Andre Petukhov and John C. Platt and Chris Quintana and Eleanor Gilbert Rieffel and Pedram Roushan and Nicholas C. Rubin and Daniel Thomas Sank and Kevin J. Satzinger and Vadim N. Smelyanskiy and Kevin J Sung and Matthew D Trevithick and Amit Vainsencher and Benjamin Villalonga and Theodore White and Z Jamie Yao and Ping Yeh and Adam Zalcman and Hartmut Neven and John M. Martinis},
  journal={Nature},
  year={2019},
  volume={574},
  pages={505 - 510},
  url={https://api.semanticscholar.org/CorpusID:204836822}
}
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.
View on Springer Nature
nature.com
6,803 Citations
Highly Influential Citations
224
Background Citations
2,099
Methods Citations
517
Results Citations
22

6,803 Citations

Strong Quantum Computational Advantage Using a Superconducting Quantum Processor.

This work develops a two-dimensional programmable superconducting quantum processor, Zuchongzhi, which is composed of 66 functional qubits in a tunable coupling architecture and establishes an unambiguous quantum computational advantage that is infeasible for classical computation in a reasonable amount of time.

The hardness of random quantum circuits

It is proved that estimating the output probabilities of random quantum circuits is #P-hard for any classical computer, and the results suggest that there is an exponential hardness barrier for the approximate classical simulation of most quantum circuits.

How many qubits are needed for quantum computational supremacy?

A quantum computational supremacy argument is refined and it is concluded that Instantaneous Quantum Polynomial-Time circuits with 208 qubits and 500 gates, Quantum Approximate Optimization Algorithm circuits with 420 qu bits and 500 constraints and boson sampling circuits are large enough for the task of producing samples from their output distributions up to constant multiplicative error to be intractable on current technology.

Programmable quantum processor implemented with superconducting circuit

A quantum processor might execute certain computational tasks exponentially faster than a classical processor. Here, using superconducting quantum circuits we design a powerful universal quantum…

Advanced quantum supremacy using a hybrid algorithm for linear systems of equations

A wealth of quantum algorithms developed during the past decades brought about the concept of quantum supremacy. The state-of-the-art noisy intermediate-scale quantum (NISQ) devices, although…

Boundaries of quantum supremacy via random circuit sampling

The constraints on the region of quantum advantage for quantum circuits with a larger number of qubits and gates than experimentally implemented are examined, finding the largest circuit size within the quantum supremacy regime coincides approximately with the smallest circuit size needed to implement error correction.

Quantum computer-aided design: digital quantum simulation of quantum processors

This work compute the static and dynamic properties of individual and coupled transmons and shows how the energy spectra of transmons can be obtained by variational hybrid quantum-classical algorithms that are well-suited for near-term noisy quantum computers.

Classical algorithms for quantum mean values

It is shown that a classical approximation is possible when the quantum circuits are limited to constant depth, and sub-exponential time classical algorithms are developed for solving the quantum mean value problem for general classes of quantum observables and constant-depth quantum circuits.

Quantum supremacy and random circuits.

It is proved that estimating the output probabilities of random quantum circuits is formidably hard for any classical computer, implying that there is an exponential hardness barrier for the classical simulation of most quantum circuits.

Quantum computational advantage with a programmable photonic processor

Borealis is used to report quantum computational advantage using Borealis, a photonic processor offering dynamic programmability on all gates implemented, which is over 50 million times as extreme as that reported from earlier photonic machines.
...

131 References

Demonstration of two-qubit algorithms with a superconducting quantum processor

A two-qubit superconducting processor and the implementation of the Grover search and Deutsch–Jozsa quantum algorithms are demonstrated and the generation of highly entangled states with concurrence up to 94 per cent is allowed.

Characterizing quantum supremacy in near-term devices

The computational cost of relevant classical algorithms is studied and it is concluded that quantum supremacy can be achieved with circuits in a two-dimensional lattice of 7 × 7 qubits and around 40 clock cycles.

How many qubits are needed for quantum computational supremacy?

A quantum computational supremacy argument is refined and it is concluded that Instantaneous Quantum Polynomial-Time circuits with 208 qubits and 500 gates, Quantum Approximate Optimization Algorithm circuits with 420 qu bits and 500 constraints and boson sampling circuits are large enough for the task of producing samples from their output distributions up to constant multiplicative error to be intractable on current technology.

A blueprint for demonstrating quantum supremacy with superconducting qubits

Nine superconducting qubits are used to demonstrate a promising path toward quantum supremacy and the scaling of errors and output with the number of qubits is explored in a five- to nine-qubit device.

Massively parallel quantum computer simulator, eleven years later

Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits

This study presents a new approach for this task that extends the boundaries of what can be computed on a classical system, and shows that it can simulate $7 \times 7$-qubit random circuits to arbitrary depth by leveraging secondary storage.

Quantum Supremacy Is Both Closer and Farther than It Appears

A massively-parallel simulation tool Rollright is developed that does not require inter-process communication (IPC) or proprietary hardware, and two ways to trade circuit fidelity for computational speedups are developed, so as to match the fidelity of a given quantum computer --- a task previously thought impossible.

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of quantum supremacy, sustaining an average performance of 281 Pflop/s on Summit, currently the fastest supercomputer in the world, are reported.

Can Chaotic Quantum Circuits Maintain Quantum Supremacy under Noise

This work shows that, for a family of chaotic quantum circuits subject to Pauli errors, there exists an non-exponential classical algorithm capable of simulating the noisy chaotic quantum circuit with bounded errors.

A path towards quantum supremacy with superconducting qubits

This thesis designs superconducting qubits and algorithms and presents experimental techniques for characterizing the complexity and fidelity of these algorithms and shows that quantum supremacy is achievable using existing technology.
...