Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2106.14734 · Physical Review Letters

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, Huiqiu 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 Hao Lin, Jin Lin, Haoran Qian, Dan Qiao, Hao Rong, Hong Te 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 Yi Zhou, Qingling Zhu, Chao‐Yang Lu, Cheng-Zhi Peng, Xiaobo Zhu, Jian-Wei Pan

Published Oct 25, 2021• 1,057 citations
arXivHTMLPDF

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)NATUAS0028-083610.1038/s41586-019-1666-5. 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.

DOI
10.1103/physrevlett.127.180501

Related papers

Establishing a New Benchmark in Quantum Computational Advantage with 105-qubit Zuchongzhi 3.0 Processor

Dongxin Gao, Daojin Fan, Chen Zha +97 more

In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62%, and 99.13%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on the Zuchongzhi 3.0 highlight its superior performance, achieving 1×10^{6} samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately 5.9×10^{9} yr to replicate the task. This leap in processing power places the classical simulation cost 6 orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Morvan et al., Nature 634, 328 (2024)10.1038/s41586-024-07998-6], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.

arXiv:2412.11924•Physical Review Letters•Mar 3, 2025•120 citations

Achieving Quantum Supremacy with Stabilized Qubits: Performance Comparison Against Classical Supercomputing Systems

Eka Cahya Muliawati

This study aims to analyze recent developments in quantum supremacy by comparing the computational performance of stabilized superconducting qubit systems with classical supercomputing capabilities. A systematic literature review was conducted on major experimental studies published between 2019 and 2024, focusing on random circuit sampling, qubit stability, gate fidelity, and computational runtime comparisons. The analysis covers key quantum processors, including Sycamore and Zuchongzhi, by evaluating three main parameters: number of qubits, circuit complexity, and performance gap relative to classical simulation.The results show that quantum processors with 50–100 qubits and high gate fidelity are able to complete specific sampling tasks within seconds to hours, whereas equivalent classical simulations would require thousands to billions of years. The findings also indicate that computational advantage increases exponentially with system scale and is strongly influenced by qubit stability and error suppression techniques. Although the demonstrated tasks remain specialized and not yet applicable to practical problems, the evidence confirms that stabilized qubit systems have achieved a measurable computational regime beyond classical feasibility.This review provides a clear synthesis of current experimental achievements and highlights that future progress toward practical quantum advantage depends on improvements in error correction, scalability, and hardware reliability.

Science Get Journal.•Feb 5, 2024•0 citations

Quantum computational advantage in random-circuit sampling on IBM superconducting quantum computers

Tigran Sedrakyan, Yuxuan Zhang, Hovnatan Karapetyan +3 more

We report forward random-circuit sampling (RCS) on the 120-qubit Nighthawk r2 superconducting processor (ibm_phoenix) with square-lattice connectivity, using 61 qubits, native CZ gates, and the standard cloud execution stack with no benchmark-specific calibration. Two independent fidelity estimators---mirror benchmarking and three- and four-patch cross-entropy benchmarking (XEB)---agree with each other at every measured depth, the mirror from 4 to 40 cycles and the patched estimators from 20 to 40 cycles, across more than two orders of magnitude of fidelity decay, and exceed the first-generation Nighthawk r1 device by more than an order of magnitude at fixed depth. The 36-cycle circuits sit at the depth where tensor-network contraction cost saturates at system size: a contraction-cost estimator validated against the published Sycamore and Zuchongzhi networks places the single-amplitude cost at $\sim$$10^{22}$ complex operations. At $F_{\mathrm{XEB}}(36)=2.3\times10^{-3}$ under favorable memory assumptions this implies $1.2\times10^{27}$ machine operations within the bounded-fidelity rejection-sampling model --- more than a century of runtime on the Frontier supercomputer --- to collect a $10^{6}$-sample ensemble, which takes only 19\,s on Nighthawk r2. To our knowledge, this is the first demonstration of quantum advantage for a vanilla random-circuit sampling on a commercially and broadly accessible quantum processor that most non-expert quantum computer users can easily replicate.

quant-pharXiv:2609.28657•Sep 25, 2026•0 citations

Quantum supremacy using a programmable superconducting processor

Frank Arute, Kunal Arya, Ryan Babbush +74 more

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. 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 qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). 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 supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. 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.

arXiv:1910.11333•Nature•Oct 23, 2019•7,718 citations

Redefining the Quantum Supremacy Baseline With a New Generation Sunway Supercomputer

Xin Liu, Chu Guo, Yong Liu +11 more

A major milestone in the era of noisy intermediate scale quantum computers is \textit{quantum supremacy} [Nature \textbf{574}, 505 (2019)] claimed on the Sycamore quantum processor of $53$ qubits, which can perform a random circuit sampling task within $200$ seconds while the same task is estimated to require a runtime of $10,000$ years on Summit. This record has been renewed with two recent experiments on the Zuchongzhi $2.0$ ($56$ qubits) and Zuchongzhi $2.1$ ($60$ qubits) quantum processors. On the other front of quantum supremacy comparison, there has also been continuous improvements on both the classical simulation algorithm as well as the underlying hardware. And a fair justification of the computational advantages for those quantum supremacy experiments would require to practically simulate the same problems on current top supercomputers, which is still in lack. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm. Our benchmark shows that the most challenging sampling task performed on Sycamore can be accomplished within $1$ week, thus collapsing the quantum supremacy claim of Sycamore. Additionally, we show that the XEB fidelities of the \textit{quantum supremacy circuits} with up to $14$ cycles can be verified in minutes, which also provides strong consistency check for quantum supremacy experiments. Our results redefine quantum supremacy baseline using the new generation Sunway supercomputer.

arXiv:2111.01066•Nov 1, 2021•4 citations

The Quantum Supercomputer “Zuchongzhi-3” and Its Significance for Modern Security

Rexhep Mustafovski

Recent advances in quantum computing have positioned it as one of the most transformative technological domains for future information processing. Unlike classical systems, quantum computers exploit principles such as superposition and entanglement to enable parallel computation and significantly enhanced processing capabilities. The superconducting quantum processor “Zuchongzhi-3,” consisting of 105 qubits arranged in a two-dimensional architecture, demonstrates notable progress in coherence time, operational precision, and error reduction, which are critical factors for scalable quantum computation. Its demonstrated computational performance indicates a clear advantage over classical supercomputers in solving specific complex problems, highlighting the emergence of quantum supremacy. From a security and defense perspective, such advancements introduce both opportunities and challenges. Quantum systems can be leveraged for high-speed analysis of large datasets, optimization of complex operational processes, and simulation of advanced scenarios that are beyond the reach of conventional systems. At the same time, their development signals potential disruptions to existing cryptographic frameworks and information security mechanisms. Comparative analysis with other leading quantum platforms shows that computational capability is not solely determined by qubit count, but also by system stability, architecture design, and operational reliability. Consequently, the evolution of quantum computing technologies reflects a broader trend toward integration with classical infrastructures, enabling hybrid computational models that enhance decision-making processes in dynamic and unpredictable environments.

•May 1, 2026•0 citations
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)NATUAS0028-083610.1038/s41586-019-1666-5. 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.
In the relentless pursuit of quantum computational advantage, we present a significant advancement with the development of Zuchongzhi 3.0. This superconducting quantum computer prototype, comprising 105 qubits, achieves high operational fidelities, with single-qubit gates, two-qubit gates, and readout fidelity at 99.90%, 99.62%, and 99.13%, respectively. Our experiments with an 83-qubit, 32-cycle random circuit sampling on the Zuchongzhi 3.0 highlight its superior performance, achieving 1×10^{6} samples in just a few hundred seconds. This task is estimated to be infeasible on the most powerful classical supercomputers, Frontier, which would require approximately 5.9×10^{9} yr to replicate the task. This leap in processing power places the classical simulation cost 6 orders of magnitude beyond Google's SYC-67 and SYC-70 experiments [Morvan et al., Nature 634, 328 (2024)10.1038/s41586-024-07998-6], firmly establishing a new benchmark in quantum computational advantage. Our work not only advances the frontiers of quantum computing but also lays the groundwork for a new era where quantum processors play an essential role in tackling sophisticated real-world challenges.
This study aims to analyze recent developments in quantum supremacy by comparing the computational performance of stabilized superconducting qubit systems with classical supercomputing capabilities. A systematic literature review was conducted on major experimental studies published between 2019 and 2024, focusing on random circuit sampling, qubit stability, gate fidelity, and computational runtime comparisons. The analysis covers key quantum processors, including Sycamore and Zuchongzhi, by evaluating three main parameters: number of qubits, circuit complexity, and performance gap relative to classical simulation.The results show that quantum processors with 50–100 qubits and high gate fidelity are able to complete specific sampling tasks within seconds to hours, whereas equivalent classical simulations would require thousands to billions of years. The findings also indicate that computational advantage increases exponentially with system scale and is strongly influenced by qubit stability and error suppression techniques. Although the demonstrated tasks remain specialized and not yet applicable to practical problems, the evidence confirms that stabilized qubit systems have achieved a measurable computational regime beyond classical feasibility.This review provides a clear synthesis of current experimental achievements and highlights that future progress toward practical quantum advantage depends on improvements in error correction, scalability, and hardware reliability.
We report forward random-circuit sampling (RCS) on the 120-qubit Nighthawk r2 superconducting processor (ibm_phoenix) with square-lattice connectivity, using 61 qubits, native CZ gates, and the standard cloud execution stack with no benchmark-specific calibration. Two independent fidelity estimators---mirror benchmarking and three- and four-patch cross-entropy benchmarking (XEB)---agree with each other at every measured depth, the mirror from 4 to 40 cycles and the patched estimators from 20 to 40 cycles, across more than two orders of magnitude of fidelity decay, and exceed the first-generation Nighthawk r1 device by more than an order of magnitude at fixed depth. The 36-cycle circuits sit at the depth where tensor-network contraction cost saturates at system size: a contraction-cost estimator validated against the published Sycamore and Zuchongzhi networks places the single-amplitude cost at ∼\sim∼102210^{22}1022 complex operations. At FXEB(36)=2.3×10−3F_{\mathrm{XEB}}(36)=2.3\times10^{-3}FXEB​(36)=2.3×10−3 under favorable memory assumptions this implies 1.2×10271.2\times10^{27}1.2×1027 machine operations within the bounded-fidelity rejection-sampling model --- more than a century of runtime on the Frontier supercomputer --- to collect a 10610^{6}106-sample ensemble, which takes only 19\,s on Nighthawk r2. To our knowledge, this is the first demonstration of quantum advantage for a vanilla random-circuit sampling on a commercially and broadly accessible quantum processor that most non-expert quantum computer users can easily replicate.
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor1. 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 qubits2–7 to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). 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 supremacy8–14 for this specific computational task, heralding a much-anticipated computing paradigm. 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.
A major milestone in the era of noisy intermediate scale quantum computers is \textit{quantum supremacy} [Nature \textbf{574}, 505 (2019)] claimed on the Sycamore quantum processor of 535353 qubits, which can perform a random circuit sampling task within 200200200 seconds while the same task is estimated to require a runtime of 10,00010,00010,000 years on Summit. This record has been renewed with two recent experiments on the Zuchongzhi 2.02.02.0 (565656 qubits) and Zuchongzhi 2.12.12.1 (606060 qubits) quantum processors. On the other front of quantum supremacy comparison, there has also been continuous improvements on both the classical simulation algorithm as well as the underlying hardware. And a fair justification of the computational advantages for those quantum supremacy experiments would require to practically simulate the same problems on current top supercomputers, which is still in lack. Here we report the full-scale simulations of these problems on new generation Sunway supercomputer, based on a customized tensor network contraction algorithm. Our benchmark shows that the most challenging sampling task performed on Sycamore can be accomplished within 111 week, thus collapsing the quantum supremacy claim of Sycamore. Additionally, we show that the XEB fidelities of the \textit{quantum supremacy circuits} with up to 141414 cycles can be verified in minutes, which also provides strong consistency check for quantum supremacy experiments. Our results redefine quantum supremacy baseline using the new generation Sunway supercomputer.
Recent advances in quantum computing have positioned it as one of the most transformative technological domains for future information processing. Unlike classical systems, quantum computers exploit principles such as superposition and entanglement to enable parallel computation and significantly enhanced processing capabilities. The superconducting quantum processor “Zuchongzhi-3,” consisting of 105 qubits arranged in a two-dimensional architecture, demonstrates notable progress in coherence time, operational precision, and error reduction, which are critical factors for scalable quantum computation. Its demonstrated computational performance indicates a clear advantage over classical supercomputers in solving specific complex problems, highlighting the emergence of quantum supremacy. From a security and defense perspective, such advancements introduce both opportunities and challenges. Quantum systems can be leveraged for high-speed analysis of large datasets, optimization of complex operational processes, and simulation of advanced scenarios that are beyond the reach of conventional systems. At the same time, their development signals potential disruptions to existing cryptographic frameworks and information security mechanisms. Comparative analysis with other leading quantum platforms shows that computational capability is not solely determined by qubit count, but also by system stability, architecture design, and operational reliability. Consequently, the evolution of quantum computing technologies reflects a broader trend toward integration with classical infrastructures, enabling hybrid computational models that enhance decision-making processes in dynamic and unpredictable environments.