Has quantum advantage been achieved?

Dominik Hangleiter

Home/Archive/arXiv

arXiv · 2603.09901

Has quantum advantage been achieved?

Dominik Hangleiter

View original source ↗Read source document ↗Export metadata ↓

Abstract

Quantum computational advantage was claimed for the first time in 2019 and several experiments since then have reinforced and strengthened the claim. At the same time, a new generation of quantum computing devices with 100 logical qubits is being built. This raises two questions: Has quantum advantage actually been achieved? And what should our next milestones be for the upcoming 100-logical-qubit era? In this perspective, I argue that, in fact, quantum advantage has been achieved. The status today is analogous to Bell-inequality violations in the 1980s where some loopholes remain open, specifically, scalability and verifiability. I then outline three milestones for the 100-logical-qubit era aiming to close those loopholes: demonstrate fault-tolerant quantum advantage, perform efficiently verifiable advantage using random circuits with symmetries, and eventually demonstrate classically verifiable advantage with applications to certified randomness. These milestones are also natural stepping stones towards running algorithms with cryptographic applications.

Explore related subjects

quant-ph cs.CC physics.hist-ph

Keep this discovery

BibTeX RIS

Dominik Hangleiter. 2026-09-08. Has quantum advantage been achieved?. https://arxiv.org/abs/2603.09901

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CC subject quant-ph subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

A brief history of quantum vs classical computational advantage

In this review article we summarize all experiments claiming quantum computational advantage to date. Our review highlights challenges, loopholes, and refutations appearing in subsequent work to provide a complete picture of the current statuses of these experiments. In addition, we also discuss theoretical computational advantage in example problems such as approximate optimization and recommendation systems. Finally, we review recent experiments in quantum error correction -- the biggest frontier to reach experimental quantum advantage in Shor's algorithm.

quant-ph↗

arXiv2026

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems

Many current and near-future applications of quantum computing utilise parametric families of quantum circuits and variational methods that can suffer from obstacles including non-convergence to the global minimum due to local minima, critical slowing down, or exponential resource scaling. Here we show that quantum imaginary time evolution can overcome these obstacles if the underlying physical system satisfies a set of conditions. This includes many relevant applications such as ground state preparation for local theories in physics or chemistry, combinatorial optimisation problems, or quantum machine learning. In particular, we analyse the quantum imaginary time evolution showing convergence guarantees to the global minimum without critical slowing down and providing a priori estimates on the required evolution time which scale linearly in system size and inverse energy gap. Furthermore, a provided complexity analysis shows that quantum imaginary time evolution can be efficiently compiled into a parametric quantum circuit, finding the optimal parameters included, for a large class of physically relevant problems.

quant-ph↗

arXiv2026

Fault-tolerant quantum processing of physical experiments

Quantum computers may reveal features of Nature inaccessible to conventional experiments, but manipulating raw quantum data introduces noise that degrades inference even when the processor is fault-tolerant, creating a data-input bottleneck for robust quantum learning. Here we show that quantum fault tolerance can substantially improve the sample complexity of learning from noisy experiments. We encode unknown quantum states from physical experiments into protected quantum memory, enabling fault-tolerant implementations of quantum learning algorithms otherwise degraded by errors. Using this quantum uploading procedure, we prove that noisy randomized measurement and multi-copy learning tasks can be performed exponentially faster than by any adaptive strategy that does not immediately encode physical states into error-corrected memory. These separations are not simply due to a reduced effective noise rate: they hold even when uploading is substantially noisier than the bare experimental interface, rigorously establishing immediate encoding as the optimal approach to noise-robust learning. We numerically illustrate the speedups in astronomical imaging, where quantum processing of uploaded photons locates an exoplanet obscured by a bright star using orders of magnitude fewer shots than unencoded baselines. Our results establish a robust interface between quantum computers and natural systems, enabling powerful and practical quantum-enhanced experiments.

quant-ph↗