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

Science Get Journal.

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

Eka Cahya Muliawati

Published Feb 5, 2024• 0 citations
Publisher

Abstract

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.

DOI
10.69855/science.v1i1.470

Related papers

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•8,266 citations

Strong Quantum Computational Advantage Using a Superconducting Quantum Processor

Yulin Wu, Wan‐Su Bao, Sirui Cao +51 more

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.

arXiv:2106.14734•Physical Review Letters•Oct 25, 2021•1,173 citations

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•175 citations

Quantum Computing: A Contemporary Review of Qubit Platforms, Algorithms, Error Correction, and Emerging Applications

Thamer A Alamoudi

Quantum computation exploits superposition, entanglement, interference, and measurement to process information.Research has moved from theoretical algorithms to functional devices where the performance is not only limited by qubit physics, but also by the control, compilation, error mitigation, and error correction.This review considers quantum computing on various levels of abstraction, including physical qubits, quantum algorithms, system architecture, fault-tolerance, and emerging applications.Study-specific evidence regarding scale, operational quality, connectivity, control and suppression of errors is compared across the different types of superconducting circuits, trapped ions, semiconductor spin qubits, neutral atoms and photonic processors.The review of the fundamental algorithms, noisy intermediate-scale quantum computing, variational and hybrid quantum-classical approaches, quantum simulation, quantum machine learning, and security implications is also discussed.Measurable progress has been demonstrated in published experiments for logical-qubit operation, below-threshold surface-code memory, programmable photonic sampling and platformspecific scaling.However, the reported metrics are not directly interchangeable, and practical advantage remains task-and baseline-dependent.Further progress will need to be accompanied by coordinated developments in hardware reliability, error correction, classical control, estimates of algorithmic resources, and clear classical method comparisons.

International Journal of Computer Applications•Aug 20, 2026•0 citations

Comprehensive Review of Quantum Computing Technologies and Processor Architectures

Babu shanmugham

This paper presents a comprehensive review of quantum computing and the technological foundations of quantum processors. Quantum computing represents a transformative computational paradigm that leverages the fundamental principles of quantum mechanics—such as superposition, entanglement, and quantum interference—to solve complex problems that are intractable for classical computers. At the core of this paradigm lies the quantum processor, a specialized hardware system designed to initialize, control, and measure quantum bits (qubits) through precise gate operations and coherent interactions. The survey examines the essential theoretical concepts underlying quantum computation and provides a structured comparison of leading quantum processor platforms. Prominent architectures, including superconducting circuits, trapped-ion systems, and photonic implementations, are analyzed in terms of their physical mechanisms, scalability, coherence properties, and engineering challenges. Each platform offers distinct advantages and faces specific technical limitations related to noise, error correction, and fabrication complexity. In addition to reviewing hardware developments, this study highlights key obstacles in advancing quantum processors toward large-scale, fault-tolerant systems. Issues such as qubit stability, error mitigation, thermal management, and system integration are discussed to present a realistic perspective on current progress. Performance indicators including gate fidelity, coherence time, connectivity, and scalability are used to compare architectural approaches. The objective of this paper is to provide a clear and organized synthesis of recent advancements in quantum computing hardware, thereby offering researchers and practitioners a foundational reference to support continued innovation and development in this rapidly evolving field.

International Journal of Engineering Development and Research•Mar 1, 2026•0 citations

Quantum supremacy in a superconducting quantum processor

John M. Martinis

The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. We have used a programmable superconducting processor to create quantum states on 53 qubits, corresponding to a "parallel computation" of 10 million trillion states. For a simple algorithm, our Sycamore processor takes about 200 seconds to run a quantum circuit a million times - 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, heralding a much-anticipated computing paradigm.

Photonics for Quantum (PfQ)•Jul 13, 2021•7 citations
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.
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.
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.
Quantum computation exploits superposition, entanglement, interference, and measurement to process information.Research has moved from theoretical algorithms to functional devices where the performance is not only limited by qubit physics, but also by the control, compilation, error mitigation, and error correction.This review considers quantum computing on various levels of abstraction, including physical qubits, quantum algorithms, system architecture, fault-tolerance, and emerging applications.Study-specific evidence regarding scale, operational quality, connectivity, control and suppression of errors is compared across the different types of superconducting circuits, trapped ions, semiconductor spin qubits, neutral atoms and photonic processors.The review of the fundamental algorithms, noisy intermediate-scale quantum computing, variational and hybrid quantum-classical approaches, quantum simulation, quantum machine learning, and security implications is also discussed.Measurable progress has been demonstrated in published experiments for logical-qubit operation, below-threshold surface-code memory, programmable photonic sampling and platformspecific scaling.However, the reported metrics are not directly interchangeable, and practical advantage remains task-and baseline-dependent.Further progress will need to be accompanied by coordinated developments in hardware reliability, error correction, classical control, estimates of algorithmic resources, and clear classical method comparisons.
This paper presents a comprehensive review of quantum computing and the technological foundations of quantum processors. Quantum computing represents a transformative computational paradigm that leverages the fundamental principles of quantum mechanics—such as superposition, entanglement, and quantum interference—to solve complex problems that are intractable for classical computers. At the core of this paradigm lies the quantum processor, a specialized hardware system designed to initialize, control, and measure quantum bits (qubits) through precise gate operations and coherent interactions. The survey examines the essential theoretical concepts underlying quantum computation and provides a structured comparison of leading quantum processor platforms. Prominent architectures, including superconducting circuits, trapped-ion systems, and photonic implementations, are analyzed in terms of their physical mechanisms, scalability, coherence properties, and engineering challenges. Each platform offers distinct advantages and faces specific technical limitations related to noise, error correction, and fabrication complexity. In addition to reviewing hardware developments, this study highlights key obstacles in advancing quantum processors toward large-scale, fault-tolerant systems. Issues such as qubit stability, error mitigation, thermal management, and system integration are discussed to present a realistic perspective on current progress. Performance indicators including gate fidelity, coherence time, connectivity, and scalability are used to compare architectural approaches. The objective of this paper is to provide a clear and organized synthesis of recent advancements in quantum computing hardware, thereby offering researchers and practitioners a foundational reference to support continued innovation and development in this rapidly evolving field.
The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. We have used a programmable superconducting processor to create quantum states on 53 qubits, corresponding to a "parallel computation" of 10 million trillion states. For a simple algorithm, our Sycamore processor takes about 200 seconds to run a quantum circuit a million times - 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, heralding a much-anticipated computing paradigm.