Evidence of Quantum Machine Learning Advantage with Tens of Noisy Qubits
Onur Danaci, Yash J. Patel, Riccardo Molteni, Evert van Nieuwenburg, Vedran Dunjko, Jan A. Krzywda

TL;DR
This study demonstrates that quantum machine learning can outperform classical methods even with noisy, near-term quantum hardware at a scale of 30-40 qubits, highlighting practical advantages.
Contribution
The paper provides the first evidence that quantum advantage in learning persists with noisy qubits at a small scale, supported by simulations and hardware analysis.
Findings
Quantum advantage observed at 30-40 noisy qubits.
Coherent quantum processing outperforms fixed-measurement schemes.
Data acquisition is the main bottleneck at this scale.
Abstract
Learning problems involving quantum data are natural candidates for demonstrating an advantage in quantum machine learning. Recent results indicate that, for certain tasks and under noiseless conditions, coherent processing of quantum data outperforms fixed-measurement schemes followed by classical processing. It remained uncertain whether this performance gap persists at a finite scale, and in the presence of noise that is unavoidable with current quantum devices. In this work, we present simulations and analysis of the performance of existing hardware on a learning problem known to exhibit asymptotic advantage, now subjected to noisy quantum data. Comparing coherent quantum processing directly against fixed-measurement schemes, our results demonstrate a clear performance separation at a scale of just 30 to 40 noisy qubits. Already at this scale, the fundamental bottleneck is no longer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
