Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2607.15815

The Fourier Wall: Why Public Tabular Datasets Refuse Quantum Advantage, and a Certified Recipe for Where It Lives

Javier Mancilla, Tomás Tagliani

quant-phSubmitted Jul 17, 2026• Announced Jul 20, 2026• 0 citations
arXivHTMLPDF

Abstract

Across public tabular benchmarks, quantum machine-learning (QML) models usually lose to carefully tuned classical baselines. We argue that this is a structural property of the datasets rather than merely a limitation of current models. Because an angle-encoded quantum neural network is a partial Fourier series, a genuine advantage can arise only when the target spectrum is simultaneously off-grid, of interaction order at least three, high-frequency, supported by near-independent features, and dense beyond practical enumeration. We call the failure to satisfy these conditions the Fourier wall. We operationalize the conditions as SPECTRA, a two-tier certificate: a simulator-free structural screen followed by a decisive comparison between a matched quantum model and five tuned classical twins using paired-bootstrap confidence bounds. On industrial smart-meter data, SPECTRA correctly refuses the real peak-load target, for which gradient-boosted trees reach a held-out ROC-AUC of 0.999. On the same real energy phases with labels generated by an interacting quantum process, the dynamics-matched quantum model reaches 0.994 versus 0.699 for the best generic classical baseline, and collapses to chance when its interaction couplings are ablated. An exact classical simulator ties the quantum model at small width but incurs measured exponential evaluation cost, with an estimated hardware crossover near 13-19 sites. These results provide a practical recipe for identifying, engineering, and deploying quantum-advantage candidates in tabular data.

Comments
16 pages, 10 figures, 2 tables, and 2 algorithms. The certified positive result uses real energy covariates with a quantum-process-generated label; the real operational target is refused

Related papers

Does Data Complexity Predict Quantum Advantage? A framework, a pre-specified test, and an attribution of the measured edge

Christophe Père

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•Sep 19, 2025•2 citations

Hybrid Quantum-Classical Neural Networks on High-Dimensional Imbalanced Tabular Data: A Convergence Efficiency Analysis

Aditya Shintre, Aditya Wankhede, Sonali Ajankar

Hybrid Quantum-Classical Neural Networks (HQNNs) offer a practical approach for near-term quantum machine learning; however, their performance on real-world, high-dimensional, and imbalanced tabular datasets remains underexplored. In this work, we benchmark HQNNs against parameter-equivalent classical models on two data-driven classification tasks: the Santander Customer Transaction dataset (200 features, 9:1 class imbalance) and the UCI Adult dataset (105 features, 3:1 class imbalance). Across 48 independent experimental trials, we evaluate 24 hybrid quantum configurations alongside 24 classical baselines by varying qubit count (N ∈ {4,6}), circuit depth (L ∈ {3,4,5}), and entanglement topology (Strongly Entangling Layers vs. Random Layers). Results show that select hybrid configurations reduce training epochs by a factor of 2–4 while maintaining competitive AUC; for example, on Santander, peak AUC is reached at 15 epochs compared to 60 for classical models, with only a 0.0166 difference in final AUC. We further observe that structured entanglement yields more stable training, and while deeper (5-layer) configurations can exhibit training variance, successful runs still yield strong convergence efficiencies. These findings highlight HQNNs as an efficient and practical approach for data-driven imbalanced classification tasks.

IEEE International Conference on Instrumentation (INSTCon)•Jul 1, 2026•0 citations

How Quantum Is the Advantage? A Fair, Calibration- and Noise-Aware Benchmark and Attribution Audit of Quantum Machine Learning for Network Intrusion Detection

Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah +2 more

Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.

quant-pharXiv:2608.18155•Aug 14, 2026•5 citations

A Matched Spectral Benchmark of Quantum Inspired Feature Maps

Toheeb Ogunade, Taofeek Kassim, Etinosa Osaro

Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed data-encoding map. Amplitude, angle, and basis encoding are evaluated as deterministic feature maps for classical supervised learning under matched output dimensionality and strong classical controls. The benchmark compares these encodings against raw linear models, random Fourier features, polynomial features, PCA, RBF SVMs, and shallow neural networks across diverse classical datasets. Rather than treating performance as a single endpoint, we analyze the geometry of each representation through effective rank, condition number, centered kernel alignment, predictive performance, and practical overhead. The resulting picture is mechanistic: amplitude encoding can remove magnitude information through unit-sphere normalization, angle encoding can become geometrically redundant with raw linear features, and basis encoding can impose a binary Hamming geometry that is poorly aligned with smooth decision structure. These findings do not argue against quantum computation, however, they show that fixed quantum-inspired encoding geometry alone is not a reliable source of machine-learning advantage on classical data.

quant-pharXiv:2605.24324•May 26, 2026•1 citation

No Free Qubit: A Falsification-Driven Investigation of Quantum Kernel Advantage Under Causal Data Structure

G Naveen Raj S

A growing body of work has questioned whether quantum machine learning (QML) offers any genuine advantage over classical methods on realistic data, with recent results showing that many apparent quantum kernel advantages are reproducible by classical surrogates once sample size, hyperparameters, and estimator variance are properly controlled. We conduct a pre-registered, falsification-first investigation into one specific, previously unexamined variant of this question: does the causal sparsity of a data-generating process as opposed to generic statistical structure modulate quantum kernel advantage or variational quantum circuit (VQC) trainability? Using a controllable structural-causal-model (SCM) data generator, a moment-matched dense-null control, and a battery of eight experiments spanning tabular regression, PDE solving, and gradient-landscape diagnostics, we find: (i) an apparent quantum-kernel advantage at small sample sizes N>=200 that consistently vanishes and reverses sign by N(approx):300, uniformly across all tested sparsity levels; (ii) no causal link between data sparsity and this advantage, once tested against a properly matched non-causal control (factorial ANOVA interaction $p=0.194$); (iii) no genuinely-quantum causal contribution to predictive performance distinguishable from estimator noise at any tested condition, including the resolution of one apparent positive result as a single-seed statistical artifact; (iv) a dissociation between classical-shadow kernel-matrix reconstruction (which fails) and task-level dequantization (which succeeds), indicating that matrix fidelity is an unreliable proxy for classical simulability; (v) a previously undocumented, reproducible failure mode in the PHASE domain-decomposition PINN architecture's boundary-continuity constraint, whose removal yields a solver that is simultaneously faster and more accurate across the full tested regime; and (vi) a robust, reproducible, but ultimately unexplained resonance phenomenon in VQC gradient variance at specific integer causal-edge counts, for which we construct, pre-register, and subsequently falsify a candidate mechanistic explanation via out-of-sample prediction. We argue that the recurring pattern of apparent effects collapsing under targeted multi-seed and out-of-sample scrutiny is itself a methodologically important finding, and we recommend such validation be treated as a mandatory component of QML advantage claims rather than an optional check applied only to surprising results.

•Jul 13, 2026•0 citations

QBioBench: benchmark of quantum machine learning for peripheral biosignals on real hardware

Marek Sokol, Jan Hejda, Petr Volf +1 more

Abstract Claims of quantum advantage in machine learning often rest on classical comparators that lack the same features, on simulation alone, and on unreported hardware cost. QBioBench is a benchmark of quantum machine learning on peripheral biosignals that holds quantum and classical models to the same features and reports calibration and hardware cost. It comprises three clinical tasks, 12-lead ECG diagnosis (PTB-XL), single-lead apnea detection (Apnea-ECG), and wearable stress detection, each reduced to six to eight shared dimensions. A factorial grid of projected and fidelity quantum kernels and variational classifiers is screened in noisy simulation, and the promoted configurations are evaluated in an exploratory study on an IBM Nighthawk r2 processor on the full test pools of 510 apnea minutes and 512 PTB-XL records. Every prediction is recovered from the device records, intervals resample recordings or patients, and classical baselines are trained on the same units and tested on the same executed inputs. No quantum model reaches its matched support vector machine in ROC-AUC on either primary task, and none is separably better in balanced accuracy. The angle-encoded fidelity and projected kernels reach ROC-AUC 0.697 and 0.693 on apnea, paired differences of − 0.127 and − 0.119 to the support vector machine, and both are classical by construction, since the entangling layer of the encoding cancels from the fidelity kernel and leaves closed-form local expectations in the projected kernel. A variational classifier comes closest, reaching 0.797 on apnea (difference − 0.012 , 95% interval [ − 0.052 , + 0.027 ] ), and falls to chance without its two-qubit gates. Test sets of the size that circuit budgets favor are unreliable, as random 80-minute subsets of the apnea pool give the fidelity kernel a central 95% range of ROC-AUC from 0.589 to 0.797. Readout mitigation changed ROC-AUC by at most 0.015.

Quantum Science and Technology•Oct 21, 2026•0 citations
Across public tabular benchmarks, quantum machine-learning (QML) models usually lose to carefully tuned classical baselines. We argue that this is a structural property of the datasets rather than merely a limitation of current models. Because an angle-encoded quantum neural network is a partial Fourier series, a genuine advantage can arise only when the target spectrum is simultaneously off-grid, of interaction order at least three, high-frequency, supported by near-independent features, and dense beyond practical enumeration. We call the failure to satisfy these conditions the Fourier wall. We operationalize the conditions as SPECTRA, a two-tier certificate: a simulator-free structural screen followed by a decisive comparison between a matched quantum model and five tuned classical twins using paired-bootstrap confidence bounds. On industrial smart-meter data, SPECTRA correctly refuses the real peak-load target, for which gradient-boosted trees reach a held-out ROC-AUC of 0.999. On the same real energy phases with labels generated by an interacting quantum process, the dynamics-matched quantum model reaches 0.994 versus 0.699 for the best generic classical baseline, and collapses to chance when its interaction couplings are ablated. An exact classical simulator ties the quantum model at small width but incurs measured exponential evaluation cost, with an estimated hardware crossover near 13-19 sites. These results provide a practical recipe for identifying, engineering, and deploying quantum-advantage candidates in tabular data.
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.
Hybrid Quantum-Classical Neural Networks (HQNNs) offer a practical approach for near-term quantum machine learning; however, their performance on real-world, high-dimensional, and imbalanced tabular datasets remains underexplored. In this work, we benchmark HQNNs against parameter-equivalent classical models on two data-driven classification tasks: the Santander Customer Transaction dataset (200 features, 9:1 class imbalance) and the UCI Adult dataset (105 features, 3:1 class imbalance). Across 48 independent experimental trials, we evaluate 24 hybrid quantum configurations alongside 24 classical baselines by varying qubit count (N ∈ {4,6}), circuit depth (L ∈ {3,4,5}), and entanglement topology (Strongly Entangling Layers vs. Random Layers). Results show that select hybrid configurations reduce training epochs by a factor of 2–4 while maintaining competitive AUC; for example, on Santander, peak AUC is reached at 15 epochs compared to 60 for classical models, with only a 0.0166 difference in final AUC. We further observe that structured entanglement yields more stable training, and while deeper (5-layer) configurations can exhibit training variance, successful runs still yield strong convergence efficiencies. These findings highlight HQNNs as an efficient and practical approach for data-driven imbalanced classification tasks.
Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.
Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed data-encoding map. Amplitude, angle, and basis encoding are evaluated as deterministic feature maps for classical supervised learning under matched output dimensionality and strong classical controls. The benchmark compares these encodings against raw linear models, random Fourier features, polynomial features, PCA, RBF SVMs, and shallow neural networks across diverse classical datasets. Rather than treating performance as a single endpoint, we analyze the geometry of each representation through effective rank, condition number, centered kernel alignment, predictive performance, and practical overhead. The resulting picture is mechanistic: amplitude encoding can remove magnitude information through unit-sphere normalization, angle encoding can become geometrically redundant with raw linear features, and basis encoding can impose a binary Hamming geometry that is poorly aligned with smooth decision structure. These findings do not argue against quantum computation, however, they show that fixed quantum-inspired encoding geometry alone is not a reliable source of machine-learning advantage on classical data.
A growing body of work has questioned whether quantum machine learning (QML) offers any genuine advantage over classical methods on realistic data, with recent results showing that many apparent quantum kernel advantages are reproducible by classical surrogates once sample size, hyperparameters, and estimator variance are properly controlled. We conduct a pre-registered, falsification-first investigation into one specific, previously unexamined variant of this question: does the causal sparsity of a data-generating process as opposed to generic statistical structure modulate quantum kernel advantage or variational quantum circuit (VQC) trainability? Using a controllable structural-causal-model (SCM) data generator, a moment-matched dense-null control, and a battery of eight experiments spanning tabular regression, PDE solving, and gradient-landscape diagnostics, we find: (i) an apparent quantum-kernel advantage at small sample sizes N>=200 that consistently vanishes and reverses sign by N(approx):300, uniformly across all tested sparsity levels; (ii) no causal link between data sparsity and this advantage, once tested against a properly matched non-causal control (factorial ANOVA interaction p=0.194p=0.194p=0.194); (iii) no genuinely-quantum causal contribution to predictive performance distinguishable from estimator noise at any tested condition, including the resolution of one apparent positive result as a single-seed statistical artifact; (iv) a dissociation between classical-shadow kernel-matrix reconstruction (which fails) and task-level dequantization (which succeeds), indicating that matrix fidelity is an unreliable proxy for classical simulability; (v) a previously undocumented, reproducible failure mode in the PHASE domain-decomposition PINN architecture's boundary-continuity constraint, whose removal yields a solver that is simultaneously faster and more accurate across the full tested regime; and (vi) a robust, reproducible, but ultimately unexplained resonance phenomenon in VQC gradient variance at specific integer causal-edge counts, for which we construct, pre-register, and subsequently falsify a candidate mechanistic explanation via out-of-sample prediction. We argue that the recurring pattern of apparent effects collapsing under targeted multi-seed and out-of-sample scrutiny is itself a methodologically important finding, and we recommend such validation be treated as a mandatory component of QML advantage claims rather than an optional check applied only to surprising results.
Abstract Claims of quantum advantage in machine learning often rest on classical comparators that lack the same features, on simulation alone, and on unreported hardware cost. QBioBench is a benchmark of quantum machine learning on peripheral biosignals that holds quantum and classical models to the same features and reports calibration and hardware cost. It comprises three clinical tasks, 12-lead ECG diagnosis (PTB-XL), single-lead apnea detection (Apnea-ECG), and wearable stress detection, each reduced to six to eight shared dimensions. A factorial grid of projected and fidelity quantum kernels and variational classifiers is screened in noisy simulation, and the promoted configurations are evaluated in an exploratory study on an IBM Nighthawk r2 processor on the full test pools of 510 apnea minutes and 512 PTB-XL records. Every prediction is recovered from the device records, intervals resample recordings or patients, and classical baselines are trained on the same units and tested on the same executed inputs. No quantum model reaches its matched support vector machine in ROC-AUC on either primary task, and none is separably better in balanced accuracy. The angle-encoded fidelity and projected kernels reach ROC-AUC 0.697 and 0.693 on apnea, paired differences of − 0.127 and − 0.119 to the support vector machine, and both are classical by construction, since the entangling layer of the encoding cancels from the fidelity kernel and leaves closed-form local expectations in the projected kernel. A variational classifier comes closest, reaching 0.797 on apnea (difference − 0.012 , 95% interval [ − 0.052 , + 0.027 ] ), and falls to chance without its two-qubit gates. Test sets of the size that circuit budgets favor are unreliable, as random 80-minute subsets of the apnea pool give the fidelity kernel a central 95% range of ROC-AUC from 0.589 to 0.797. Readout mitigation changed ROC-AUC by at most 0.015.