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

Chemical & Engineering News

IBM claims its quantum computers outperform classical ones

Ananya Palivela

Published Aug 3, 2026• 0 citations
Publisher
DOI
10.47287/cen.557497.newsarticle

Related papers

What IBM’s result means for quantum computing

Shamini Bundell, Nick Petrić Howe

Nature•Jun 14, 2023•1 citation

Beyond Classical

Robert Hundt

The term Beyond Classical is now the preferred term to describe computation that can be run efficiently on a quantum computer but would be intractable to run on a classical computer. A seminal paper by Google claimed to have reached this goal by computing a result in 200 seconds that a supercomputer would need 10,000 years to compute. Soon after publication, IBM claimed that the same computation could be done in just a few days on the Summit supercomputer. In this chapter, we analyze this disagreement. We discuss the proposition, implement and simulate the circuit, estimate simulation time for 53 qubits, and contrast Google’s claim against our implementation and IBM’s estimation result.

Cambridge University Press eBooks•Feb 28, 2022•0 citations

IBM invests in quantum computing based on Josephson junctions

Physics Today•Nov 11, 2010•1 citation

Computational advantage of quantum random sampling

Dominik Hangleiter, Jens Eisert

Quantum computers have improved and recent experiments have claimed quantum advantage -- completion of a computational task that is evidently hard for any conventional computer. The problem solved is that of obtaining samples, by quantum measurement, from a certain probability distribution. This review shows in what precise way quantum random sampling can be seen as a computation. It explains what that computation solves, in what way it outperforms classical computations, and what methods of verification are available. Quantum random sampling becomes a first test of the presumed exponential computational advantage of quantum computers over classical ones.

arXiv:2206.04079•Reviews of Modern Physics•Jul 20, 2023•208 citations

A Critical Assessment of Reversible Computing’s Role in the Quantum Advantage Narrative

White Elijah

Reversibility is one of the most frequently invoked ideas in the public and scholarly narrative around quantum computational advantage. It is cited to explain why quantum computers can outperform classical ones, why they might be energy efficient, and why classical hardware may or may not be able to compete. This paper asks which of these claims survive scrutiny. It separates three senses of reversibility that are often run together: logical reversibility (a computation that preserves information), thermodynamic reversibility (a physical process that approaches zero dissipation), and unitary reversibility (the invertible evolution of an isolated quantum system). The paper then traces four channels through which reversibility enters the quantum advantage discussion: historical lineage, algorithm and circuit engineering, energy accounting, and competition from reversible classical hardware. It assesses six recurring claims against an explicit evidence ladder. The assessment finds that reversibility is not the source of quantum advantage, because reversible classical machines are no more powerful than irreversible ones. Unitarity is necessary only in the idealized circuit model, not in every physical architecture. Reversible-computing theory contributes substantially and credibly to quantum circuit engineering, especially in arithmetic, ancilla management, and uncomputation. Claims that quantum computers are energy efficient because they are reversible are not supported by the current literature, since measurement, reset, error correction, and cryogenic and classical control infrastructure are irreversible and dominate the energy budget.

•Oct 30, 2026•0 citations

IBM builds prototype quantum computing chip

Physics Today•Apr 30, 2015•0 citations
The term Beyond Classical is now the preferred term to describe computation that can be run efficiently on a quantum computer but would be intractable to run on a classical computer. A seminal paper by Google claimed to have reached this goal by computing a result in 200 seconds that a supercomputer would need 10,000 years to compute. Soon after publication, IBM claimed that the same computation could be done in just a few days on the Summit supercomputer. In this chapter, we analyze this disagreement. We discuss the proposition, implement and simulate the circuit, estimate simulation time for 53 qubits, and contrast Google’s claim against our implementation and IBM’s estimation result.
Quantum computers have improved and recent experiments have claimed quantum advantage -- completion of a computational task that is evidently hard for any conventional computer. The problem solved is that of obtaining samples, by quantum measurement, from a certain probability distribution. This review shows in what precise way quantum random sampling can be seen as a computation. It explains what that computation solves, in what way it outperforms classical computations, and what methods of verification are available. Quantum random sampling becomes a first test of the presumed exponential computational advantage of quantum computers over classical ones.
Reversibility is one of the most frequently invoked ideas in the public and scholarly narrative around quantum computational advantage. It is cited to explain why quantum computers can outperform classical ones, why they might be energy efficient, and why classical hardware may or may not be able to compete. This paper asks which of these claims survive scrutiny. It separates three senses of reversibility that are often run together: logical reversibility (a computation that preserves information), thermodynamic reversibility (a physical process that approaches zero dissipation), and unitary reversibility (the invertible evolution of an isolated quantum system). The paper then traces four channels through which reversibility enters the quantum advantage discussion: historical lineage, algorithm and circuit engineering, energy accounting, and competition from reversible classical hardware. It assesses six recurring claims against an explicit evidence ladder. The assessment finds that reversibility is not the source of quantum advantage, because reversible classical machines are no more powerful than irreversible ones. Unitarity is necessary only in the idealized circuit model, not in every physical architecture. Reversible-computing theory contributes substantially and credibly to quantum circuit engineering, especially in arithmetic, ancilla management, and uncomputation. Claims that quantum computers are energy efficient because they are reversible are not supported by the current literature, since measurement, reset, error correction, and cryogenic and classical control infrastructure are irreversible and dominate the energy budget.