Strong quantum computational advantage using a superconducting quantum processor

Abstract

Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a two-dimensional programmable superconducting quantum processor, \textit{Zuchongzhi}, which is composed of 66 functional qubits in a tunable coupling architecture. To characterize the performance of the whole system, we perform random quantum circuits sampling for benchmarking, up to a system size of 56 qubits and 20 cycles. The computational cost of the classical simulation of this task is estimated to be 2-3 orders of magnitude higher than the previous work on 53-qubit Sycamore processor [Nature \textbf{574}, 505 (2019)]. We estimate that the sampling task finished by \textit{Zuchongzhi} in about 1.2 hours will take the most powerful supercomputer at least 8 years. Our work establishes an unambiguous quantum computational advantage that is infeasible for classical computation in a reasonable amount of time. The high-precision and programmable quantum computing platform opens a new door to explore novel many-body phenomena and implement complex quantum algorithms.

References in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Charge insensitive qubit design derived from the Cooper pair box
• Surface codes: Towards practical large-scale quantum computation
• Probing many-body dynamics on a 51-atom quantum simulator
• Quantum computational advantage using photons
• Simulated Quantum Computation of Molecular Energies
• Resolving photon number states in a superconducting circuit
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Experimental quantum speed-up in reinforcement learning agents
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Classical Simulation of Quantum Supremacy Circuits
• Simulating the Sycamore quantum supremacy circuits
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm

Cited by in corpus (5)

• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Realization of arbitrary doubly-controlled quantum phase gates
• Physical reservoir computing using finitely-sampled quantum systems
• Variational Quantum Simulation of Chemical Dynamics with Quantum Computers
• Enhancing entanglement and total correlations dynamics via local unitaries