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

• URL: http://arxiv.org/abs/2607.15815v1
• Date: Fri, 17 Jul 2026 10:24:57 GMT
• Title: The Fourier Wall: Why Public Tabular Datasets Refuse Quantum Advantage, and a Certified Recipe for Where It Lives
• Abstract summary: Quantum machine-learning models usually lose to carefully tuned classical baselines.<n>We operationalize the conditions as SPECTRA, a simulator-free structural screen.<n>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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Discretization-Aware Fine-Tuning for Quantum Machine Learning with Chemical Foundation Models [0.0]
  Key challenge in practical quantum machine learning (QML) is the limited capacity of near-term quantum devices to encode high-dimensional classical data into small quantum registers.<n>We introduce discretization-aware fine-tuning (DAFT), a method that adapts a pre-trained chemical foundation model to produce representations that remain informative after quantization.<n>We evaluate both quantum and classical models under a controlled setting in which they receive identical discretized bit-string inputs.
  arXiv  Detail & Related papers  (2026-09-02T23:36:29Z)
• Classical and Hybrid Quantum Machine Learning for Trigger-Like Event Selection on CMS Open Data: An Eight-Qubit, PCA-Constrained Benchmark [0.9106818059692908]
  Event triggering sits at the heart of high-energy physics, where rare events of interest must be retained.<n>This work compares four classical machine learning models, namely a support vector machine, an artificial neural network, a convolutional network and a long short-term memory network.<n>Four hybrid quantum counterparts, on a trigger-like binary classification task built from CMS open data.
  arXiv  Detail & Related papers  (2026-08-26T15:32:44Z)
• Quantum Incremental Learning with Mixed State Prototypes [53.319426778720434]
  We introduce a novel quantum incremental learning framework based on trainable mixed-state prototypes.<n>Our model achieves high-dimensional feature concentration using a minimal number of qubits.
  arXiv  Detail & Related papers  (2026-08-11T04:22:42Z)
• Hybrid Quantum-Classical Learning of Nonlinear Entanglement Witnesses via Continuous-Variable Quantum Neural Networks [0.0]
  We introduce a hybrid quantum-classical framework that learns a nonlinear entanglement witness directly from quantum data using continuous-variable quantum neural networks (CV-QNNs)<n>Our architecture combines variational interferometers, squeezers and non-Gaussian Kerr gates with a small classical neural head to output a scalar witness value.<n>We show that when the quantum measurement stage is informationally complete, the hybrid model can approximate any continuous witness-like functional on compact sets of states.
  arXiv  Detail & Related papers  (2025-09-07T04:45:59Z)
• Quantum Visual Fields with Neural Amplitude Encoding [70.86293548779774]
  We introduce a new type of Quantum Implicit Neural Representation (QINR) for 2D image and 3D geometric field learning.<n>QVF encodes classical data into quantum statevectors using neural amplitude encoding grounded in a learnable energy manifold.<n>Our ansatz follows a fully entangled design of learnable parametrised quantum circuits, with quantum (unitary) operations performed in the real Hilbert space.
  arXiv  Detail & Related papers  (2025-08-14T17:59:52Z)
• Quantum Machine Learning for Predicting Binding Free Energies in Structure-Based Virtual Screening [0.0]
  We introduce a quantum machine learning approach that encodes molecular information into quantum states.<n>With six quantum circuit units, the model achieves an RMSD of 2.37 kcal/mol and a Pearson correlation of 0.650.
  arXiv  Detail & Related papers  (2025-07-24T14:01:39Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• QPMeL - Quantum-Aware Classically-Trained Embeddings via Projective Metric Learning [0.8656254015205943]
  We propose Quantum Polar Metric Learning (QPMeL) that uses a classical model to learn the parameters of the polar form of a qubit.<n>We then utilize a shallow PQC with $R_y$ and $R_z$ gates to create the state and a trainable layer of $ZZ(theta)$-gates to learn entanglement.<n>When compared to QMeL approaches, QPMeL achieves 3X better multi-class separation, while using only 1/2 the number of gates and depth.
  arXiv  Detail & Related papers  (2023-12-04T06:13:53Z)
• When BERT Meets Quantum Temporal Convolution Learning for Text Classification in Heterogeneous Computing [75.75419308975746]
  This work proposes a vertical federated learning architecture based on variational quantum circuits to demonstrate the competitive performance of a quantum-enhanced pre-trained BERT model for text classification. Our experiments on intent classification show that our proposed BERT-QTC model attains competitive experimental results in the Snips and ATIS spoken language datasets.
  arXiv  Detail & Related papers  (2022-02-17T09:55:21Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.