Does quantum computing speed up machine learning?
For machine learning on ordinary classical data: no. As of August 2026 there is no demonstrated quantum speedup for any practical ML task, and the headline exponential claims of the 2010s were largely dismantled by classical "dequantized" algorithms starting with Tang in 2018. The one proven, hardware-demonstrated advantage is for learning from quantum data — which almost no ML workload is.
No exponential speedup — the flagship claims were dequantized in 2018 The quantum recommendation-system algorithm was the star exhibit for exponential QML speedups. Ewin Tang showed that under the same data-access assumptions the quantum algorithm needs, a classical algorithm solves the problem with only polynomial slowdown — no exponential advantage ever existed. Follow-up work dequantized most of the low-rank QML toolkit. Lesson for developers: check what data-access assumptions a QML speedup claim smuggles in.
QML circuits run on real hardware — with zero demonstrated advantage The quantum-kernel idea is legitimate: use a quantum circuit to map data into a feature space that is hard to compute classically, then classify with a standard SVM. It has been demonstrated on hardware since 2019. What has never been demonstrated is any dataset where this beats classical ML — the known cases where quantum kernels provably win are built from cryptographic structure (discrete logarithms), not from data anyone actually has.
Established theory works against QML: training collapses at scale Variational QML trains a quantum circuit with a classical optimizer, gradient-descent style. McClean and colleagues proved that for generic circuit families the training landscape is exponentially flat: at useful qubit counts, every gradient estimate reads as noise. Later work sharpened the dilemma — many architectures known to avoid barren plateaus turn out to be classically simulable, which would make the quantum hardware redundant. This is a structural problem, not an engineering one.
Yes — but only when the data itself is quantum This is the one rigorous, hardware-demonstrated learning advantage: when the input is quantum states from an experiment (not a CSV), a quantum memory that stores two copies and measures them jointly needs exponentially fewer samples than any classical strategy, provably. It is real and it is not your ML workload — it applies to characterizing quantum devices and quantum experiments, not to images, text or tabular data.
What happened to the exponential QML speedups?
The 2010s wave of QML rested on quantum linear algebra: algorithms like HHL promised to solve linear systems exponentially faster. The fine print always contained three traps: the data must be loaded into quantum amplitudes (expensive, and generally assumed away via "QRAM", hardware that still does not exist), the matrix must be well-conditioned, and the output is a quantum state you cannot cheaply read out.
In 2018, Ewin Tang — then an undergraduate — showed the killer move: give a classical algorithm the equivalent data-access assumption (the ability to sample from the data), and it matches the quantum recommendation algorithm up to polynomial factors. The exponential gap was an artifact of comparing a quantum algorithm with generous assumptions against a classical one without them. Most low-rank QML fell to the same technique.
What survives: speedups for sparse, high-rank, well-conditioned problems — a niche that so far maps poorly onto real ML.
Is there any real quantum advantage in machine learning?
Yes, one — and it is narrow. When the data is itself quantum (states coming out of a physics experiment or a quantum device), a provable exponential advantage in sample complexity exists and has been demonstrated on Google hardware. If you work on quantum device characterization, this matters to you. If you train models on classical data, it does not.
For classical data, the honest scoreboard reads: no proven end-to-end speedup, no empirical win on any benchmark anyone uses, and a structural training obstacle (barren plateaus) for the variational approaches that fit near-term hardware. Contrived problems built from discrete logarithms show quantum classifiers can win in principle — a statement about complexity theory, not about your data.
You can run a small variational classifier yourself in the lab to see what two-qubit QML actually looks like.
What would have to change for the answer to change?
Watch for these, in roughly descending order of impact:
- An end-to-end demonstration on classical data — including data loading and readout — that beats the best classical method. This is the bar every claim so far has failed.
- QRAM that exists. Most exponential-speedup claims quietly assume a quantum memory addressing N items in log(N) time with negligible noise. Nobody has built one at any useful scale.
- Trainable-but-not-simulable architectures. Escaping the barren-plateau dilemma without collapsing into something a classical computer can simulate.
Until then, treat "quantum machine learning" in a product pitch as a red flag. Related: can quantum computers solve optimization problems faster?
Classifications follow the QPU137 editorial policy: every applied label carries a date, source, scale, and hardware, or it does not render. Found an error? Report it.