Strong Quantum Computational Advantage Using a Superconducting Quantum Processor
Yulin Wu, Wan-Su Bao, Sirui Cao, Fusheng Chen, Ming-Cheng Chen, Xiawei Chen, Tung-Hsun Chung, Hui Deng, Yajie Du, Daojin Fan, Ming Gong, Cheng Guo, Chu Guo, Shaojun Guo, Lianchen Han, Linyin Hong, He-Liang Huang, Yong-Heng Huo, Liping Li, Na Li, Shaowei Li, Yuan Li, Futian Liang, Chun Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Su, Lihua Sun, Liangyuan Wang, Shiyu Wang, Dachao Wu, Yu Xu, Kai Yan, Weifeng Yang, Yang Yang, Yangsen Ye, Jianghan Yin, Chong Ying, Jiale Yu, Chen Zha, Cha Zhang, Haibin Zhang, Kaili Zhang, Yiming Zhang, Han Zhao, Youwei Zhao, Liang Zhou, Qingling Zhu, Chao-Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, Jian-Wei Pan
DOI 10.1103/PhysRevLett.127.180501 · Physical Review Letters
Active bibliographic source — not scientific approval
Bibliographic access preserves source history; it does not approve extracted materials or validate reported claims. Review warnings on each occurrence separately.
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, 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 574, 505 (2019). We estimate that the sampling task finished by Zuchongzhi in about 1.2 h will take the most powerful supercomputer at least 8 yr. 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.
Similar papers
Benchmarking quantum optimization for the maximum-cut problem on a superconducting quantum computer
similarity 0.86Maxime Dupont et al.
Source status unknown — claims are unverified
Quantum speeding-up of computation demonstrated in a superconducting two-qubit processor
similarity 0.86Andreas Dewes et al.
Source status unknown — claims are unverified
Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor
similarity 0.86Tanay Roy et al.
Source status unknown — claims are unverified
Conveyor-belt superconducting quantum computer
similarity 0.86Francesco Cioni et al.
Source status unknown — claims are unverified
Time-optimal universal quantum gates on superconducting circuits
similarity 0.85Ze Li et al.
Source status unknown — claims are unverified
Programmable Superconducting Processor with Native Three-Qubit Gates
similarity 0.85Tanay Roy et al.
Source status unknown — claims are unverified