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 classical computation but data acquisition; matching the noisy coherent protocol with measure-first strategies would still require months or even years of measurements. By systematically evaluating hardware constraints such as state preparation, gate errors, readout errors, connectivity, and coherence times, we provide evidence that a demonstration of such a strong learning advantage is accessible on near-term devices.
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 classical computation but data acquisition; matching the noisy coherent protocol with measure-first strategies would still require months or even years of measurements. By systematically evaluating hardware constraints such as state preparation, gate errors, readout errors, connectivity, and coherence times, we provide evidence that a demonstration of such a strong learning advantage is accessible on near-term devices.
Quantum computing has generated significant expectations for its potential to enhance machine learning (ML) tasks, with theoretical research proposing computational advantages ranging from polynomial to exponential speedups for specific subroutines.However, a critical disconnect remains: theoretical or asymptotic speedup claims do not automatically imply a practical, end-to-end advantage.Current evidence does not clearly establish whether these claimed advantages translate into measurable superiority over optimised classical approaches.This review critically assesses the relationship between theoretical claims of quantum advantage and the currently available practical and experimental evidence.We critically examine the evidence and assumptions underlying claimed speedups, including the overheads associated with data encoding and access, as well as the use of appropriate and competitive classical baselines for fair comparison.The scope of this assessment covers key limiting factors, such as scalability, trainability, hardware noise in the noisy intermediate-scale quantum (NISQ) era, and overall resource requirements.By distinguishing between theoretical potential and demonstrated practical performance, this work identifies where current evidence is convincing and where it remains insufficient.The review identifies the specific conditions required for the credible validation of quantum advantage and argues that future progress must be positioned around rigorous, realistic, and end-to-end evaluation rather than theoretical complexity claims alone.
Abstract The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch–Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, limiting the obtained advantage. Here we solve an oracle-based problem, known as learning parity with noise, on a five-qubit superconducting processor. Executing classical and quantum algorithms using the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a significant quantum advantage already emerges in existing noisy systems.
We develop a framework for learning from noisy quantum experiments in which fault-tolerant devices access uncharacterized systems through noisy couplings. Introducing the complexity class NBQP ("noisy BQP''), we model noisy fault-tolerant quantum computers that cannot generally error-correct the oracle systems they query. Using this class, we prove that while noise can eliminate the exponential quantum learning advantages of unphysical, noiseless learners, a superpolynomial gap remains between NISQ and fault-tolerant devices. Turning to canonical learning tasks in noisy settings, we find that the exponential two-copy advantage for purity testing collapses under local depolarizing noise. Nevertheless, we identify a setting motivated by AdS/CFT in which noise-resilient physical structure restores this quantum learning advantage. We then analyze noisy Pauli shadow tomography, deriving lower bounds characterizing how instance size, quantum memory and noise jointly control sample complexity, and design algorithms with parametrically matching scalings. We study similar tradeoffs in quantum metrology, and show that the Heisenberg-limited sensitivity of existing error-correction-based protocols persists only up to a timescale inverse-polynomial in the error rate per probe qubit. Together, our results demonstrate that the primitives underlying quantum-enhanced experiments are fundamentally fragile to noise, and that realizing meaningful quantum advantages in future experiments will require interfacing noise-robust physical properties with available algorithmic techniques.
An interesting approach to using noisy intermediate-scale quantum (NISQ) devices is hybrid classical-quantum machine learning (QML). In these methods, classical processors handle optimisation and large-scale computation, while quantum hardware is devoted to tasks like feature mapping, nonlinear transformations, or kernel evaluation. Practical near-term demonstrations are made possible by this division of labour, which also mitigates existing hardware restrictions. In specialised fields like molecular modelling, materials discovery, and small-sample learning issues, recent advancements in variational quantum circuits, hybrid neural networks, and quantum kernel techniques have produced promising outcomes. However, scalability and wider applicability are still hampered by enduring issues including noise, barren plateaus, and the expense of repeated measurements. Long-term developments will require fault tolerance, logical qubits, and established software infrastructures, whereas near-term success depends on noise-aware algorithm design, repeatable experimental benchmarks, and enhanced error-mitigation strategies. When taken as a whole, these advancements show a viable path to achieving quantum advantage in machine learning. Quanta 2026; 15: 1–12.
This work focuses on quantum machine learning and analyzes the power of one single qubit to solve classical machine learning problems. We explore possible strategies to address traditional supervised, unsupervised, and reinforcement learning tasks. In particular, we study binary and multinomial classification, regression problems, time series forecasting, clustering, and quantum reinforcement learning. Our results suggest that the same methodology could be used to address all three types of learning with different measurement strategies and, despite the strong limitation of reduced data dimensionality of the candidate problems, a single qubit can achieve similar or even improved performance with respect to state-of-the-art classic machine learning methods in many cases. As simulating the evolution of one qubit state is computationally efficient, our study enables the possibility to use the qubit model as a candidate solution to implement simple decision-making machine learning models in hardware with extremely low memory resources such as embedded systems or edge devices. The outcomes provided could be also of interest in academia and for the construction of demonstrators using low-scale contemporary quantum hardware.
Quantum machine learning sits at the intersection of two paradigm-shifting technologies: quantum computing and deep learning. By exploiting quantum mechanical phenomena – superposition, entanglement, and interference – QML promises exponential or quadratic speedups over classical algorithms for certain learning tasks, as well as the ability to model quantum data natively. However, the path to practical quantum advantage remains contested, constrained by noisy intermediate-scale quantum (NISQ) hardware, limited qubit counts (50–1,000), coherence times (50–500 μs), and high gate error rates (10⁻³–10⁻⁴). This paper provides a rigorous, technically deep survey of QML: mathematical foundations (Hilbert spaces, unitary evolution, measurement, quantum circuits), canonical algorithms (quantum kernel methods, variational quantum circuits (VQCs), quantum neural networks (QNNs), QSVMs, quantum generative adversarial networks (QGANs), encoding strategies (angle, amplitude, basis, and Hamiltonian encoding), optimization landscapes (barren plateaus, parameter shift rules, ansatz design), hardware aware implementation on superconducting (IBM, Google), trapped ion (IonQ), and neutral atom (Pasqal) platforms, empirical benchmarks on near term devices for classification, generative modeling, and quantum chemistry, and pathways to fault tolerant quantum machine learning (FTQML) with error correction (surface codes, logical qubits). Researchers critically assess claims of quantum advantage, identify scenarios where QML may outperform classical ML (small data, high-dimensional feature spaces from quantum systems, kernel estimation), and propose concrete evaluation metrics (quantum-classical cross-validation, resource estimation).