aiqbench analysis
This study rigorously tests whether data complexity metrics can reliably forecast quantum advantage in machine learning tasks, ultimately finding that current composite measures fail to predict performance edges across diverse datasets. The results indicate that observed advantages are often artifacts of classical baseline weaknesses rather than intrinsic quantum superiority, except in highly specific, structure-aware scenarios. For the community, this clarifies the gap between theoretical potential and practical realization, emphasizing that data complexity alone is insufficient without addressing representation headroom and classical baseline selection.
Does Data Complexity Predict Quantum Advantage? A framework, a pre-specified test, and an attribution of the measured edge
arXiv:2509.16410v2 Announce Type: replace Abstract: Quantum machine learning (QML) holds promise for pattern recognition, optimization, and data analysis, but the conditions under which it can outperform classical methods remain unclear. We propose data complexity--the structural, statistical, algorithmic, and topological richness of a dataset--as a central axis for stating such conditions, and test the resulting framework under a pre-specified benchmark. The central predictive claim fails. A composite complexity measure does not predict the budget-matched quantum edge across 27 datasets in leave-one-dataset-out validation (pooled R^2=-0.32, versus a pre-specified threshold of 0.4). The failure is strongly coupled to the classical baseline: against logistic regression, the selector reaches R^2=+0.13 and the parity family wins 17% of cells, whereas against the best of six standard classical models performance falls to R^2=-0.94, with parity winning only 1%. The apparent signal therefore tracks classical model error rather than a robust quantum contribution. The tested encoding and reduction procedures further leave little nonlinear headroom for the downstream model to exploit; gradient boosting matches a linear probe across the tested widths. The null is also constrained by the regime: quantum performance is at chance in 81.5% of cells. Yet a deliberately constructed quantum-signature control produces a +0.42 edge under a structure-aware measurement, while generic models required to learn that structure remain near chance. Thus the null result is not evidence that quantum-sensitive structure cannot exist. Rather, in the tested regime, data complexity alone does not predict quantum advantage: the observable edge depends jointly on the classical baseline, accessible data structure, representation and model headroom, and whether quantum-sensitive structure is accessible to the measurement.
Title:Does Data Complexity Predict Quantum Advantage? A framework, a pre-specified test, and an attribution of the measured edge
Abstract:Quantum machine learning (QML) holds promise for pattern recognition, optimization, and data analysis, but the conditions under which it can outperform classical methods remain unclear. We propose data complexity--the structural, statistical, algorithmic, and topological richness of a dataset--as a central axis for stating such conditions, and test the resulting framework under a pre-specified benchmark. The central predictive claim fails. A composite complexity measure does not predict the budget-matched quantum edge across 27 datasets in leave-one-dataset-out validation (pooled R^2=-0.32, versus a pre-specified threshold of 0.4). The failure is strongly coupled to the classical baseline: against logistic regression, the selector reaches R^2=+0.13 and the parity family wins 17% of cells, whereas against the best of six standard classical models performance falls to R^2=-0.94, with parity winning only 1%. The apparent signal therefore tracks classical model error rather than a robust quantum contribution. The tested encoding and reduction procedures further leave little nonlinear headroom for the downstream model to exploit; gradient boosting matches a linear probe across the tested widths. The null is also constrained by the regime: quantum performance is at chance in 81.5% of cells. Yet a deliberately constructed quantum-signature control produces a +0.42 edge under a structure-aware measurement, while generic models required to learn that structure remain near chance. Thus the null result is not evidence that quantum-sensitive structure cannot exist. Rather, in the tested regime, data complexity alone does not predict quantum advantage: the observable edge depends jointly on the classical baseline, accessible data structure, representation and model headroom, and whether quantum-sensitive structure is accessible to the measurement.
arXiv:2509.16410 [quant-ph]
(or arXiv:2509.16410v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2509.16410 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 366 words
Related coverage
Links #5: 2026/07
LessWrong · Jul 31, 2026
Toward a Kantian refutation of Agent Foundations
LessWrong · Jun 17, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

FNOs Predict All Local Observables From Subset Measurements
Quantum Zeitgeist · May 29, 2026