Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation
- URL: http://arxiv.org/abs/2604.18837v1
- Date: Mon, 20 Apr 2026 21:03:02 GMT
- Title: Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation
- Abstract summary: Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning.<n>We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models.<n>Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at $= 0.05$; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning, yet rigorous benchmarks against strong classical baselines remain scarce. We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models, totalling 970 experiments with strict nested cross-validation. Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at $α= 0.05$; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical baseline; (iii) hardware validation on IBM ibm_fez (Heron r2), demonstrating kernel fidelity $r \geq 0.976$ across six experiments; and (iv) seed sensitivity analysis confirming reproducibility (mean CV 1.4%). A Kruskal-Wallis factorial analysis reveals that dataset choice dominates performance variance ($\varepsilon^2 = 0.73$), while kernel type accounts for only 9%. Spectral analysis offers a mechanistic explanation: current quantum feature maps produce eigenspectra that are either too flat or too concentrated, missing the intermediate profile of the best classical kernel, the radial basis function (RBF). Quantum kernel training (QKT) via kernel-target alignment yields the single competitive result -- balanced accuracy 0.968 on breast cancer -- but with ~2,000x computational overhead. Our findings provide actionable guidelines for quantum kernel research. The complete benchmark suite is publicly available to facilitate reproduction and extension.
Related papers
- The ZZ feature map induces a signless Laplacian metric: a closed-form classical surrogate for quantum kernel regression [0.0]
We prove that in the small-bandwidth regime the induced kernel is, to leading order, an anisotropic Gaussian kernel with metric M = I + pi2 Q.<n>The corresponding classical kernel requires no fitted parameters and no quantum simulation.
arXiv Detail & Related papers (2026-08-29T19:59:00Z) - Evaluating Quantum Kernel Methods for Track-Based Classification in High-Energy Physics [0.0]
We present a design for large-scale quantum kernel classification using centroid-based CLAS12 drift-chamber features.<n>Each event is encoded into a six-qubit state via a fully entangled ZZFeatureMap, whose fidelities define a quantum kernel within a standard SVM framework.
arXiv Detail & Related papers (2026-08-27T16:35:30Z) - Effective Dimension Governs Generalization in Quantum Kernel Vision Models [31.082191748525137]
We show that entanglement structure and quantum noise are two knobs that move $d_rm eff$.<n>Amplitude damping contracts $d_rm eff$ and lifts test accuracy by up to $+13%$ along an inverted-U sweet spot.
arXiv Detail & Related papers (2026-06-18T12:55:59Z) - Large-Scale Quantum Kernels for Hyperspectral Data Classification [0.0]
We present the first large-scale study of fidelity-quantum- Kernel support vector machines for hyperspectral data classification.<n>We overcome the computational bottlenecks traditionally associated with quantum models, achieving quadratic scaling O(n2) in the number of qubits.<n>We provide an in-depth analysis of kernel bandwidth optimization, demonstrating its crucial role in mitigating exponential concentration effects.
arXiv Detail & Related papers (2026-05-17T18:32:12Z) - Analog Quantum Feature Selection with Neutral-Atom Quantum Processors [31.458406135473805]
We present a quantum-native approach to quantum feature selection (QFS) based on analog quantum simulation with neutral atom arrays.<n>The protocol is evaluated through simulations on three benchmark binary classification datasets: Adult Income, Bank Marketing, and Telco Churn.<n>For compact subsets of 2-5 features, analog QFS improves mean AUC scores by 1.5-2.3% while reducing the number of features by 75-84%.
arXiv Detail & Related papers (2025-10-23T17:57:34Z) - Potential of multi-anomalies detection using quantum machine learning [0.28647133890966986]
In vibration analysis, AR model coefficients combined with one-class SVMs are used for detecting anomalies.<n>In this work, we explore the effect of substituting the classical kernel in the one-class SVM with a quantum kernel.<n>Our results show a clear advantage of quantum kernels over classical Gaussian (RBF) kernels.
arXiv Detail & Related papers (2025-10-08T14:24:14Z) - Exploring an implementation of quantum learning pipeline for support vector machines [0.10742675209112622]
This work presents a fully quantum approach to support vector machine (SVM) learning by integrating gate-based quantum kernel methods with quantum annealing-based optimization.<n>We explore the construction of quantum kernels using various feature maps and qubit, evaluating their suitability through Kernel-Target Alignment.<n>Our experiments demonstrate that a high degree of alignment in the kernel and an appropriate regularization parameter lead to competitive performance, with the best model achieving an F1-score of 90%.
arXiv Detail & Related papers (2025-09-05T10:19:32Z) - Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
arXiv Detail & Related papers (2025-07-09T15:22:17Z) - 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) - Benchmarking quantum machine learning kernel training for classification tasks [0.0]
This study focuses on quantum kernel methods in the context of classification tasks.<n>It examines the performance of Quantum Kernel Estimation (QKE) and Quantum Kernel Training (QKT) in connection with two quantum feature mappings.<n> Experimental results indicate that quantum methods exhibit varying performance across different datasets.
arXiv Detail & Related papers (2024-08-17T10:53:06Z) - Shot-frugal and Robust quantum kernel classifiers [12.146571029233435]
Quantum kernel methods are a candidate for quantum speed-ups in machine learning.
We show that for classification tasks, the aim is reliable classification and not precise kernel evaluation.
We motivate a new metric that characterizes the reliability of classification.
arXiv Detail & Related papers (2022-10-13T12:48:23Z) - Noisy Quantum Kernel Machines [58.09028887465797]
An emerging class of quantum learning machines is that based on the paradigm of quantum kernels.
We study how dissipation and decoherence affect their performance.
We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
arXiv Detail & Related papers (2022-04-26T09:52:02Z) - Training Quantum Embedding Kernels on Near-Term Quantum Computers [0.08563354084119063]
Quantum embedding kernels (QEKs) constructed by embedding data into the Hilbert space of a quantum computer are a particular quantum kernel technique.
We first provide an accessible introduction to quantum embedding kernels and then analyze the practical issues arising when realizing them on a noisy near-term quantum computer.
arXiv Detail & Related papers (2021-05-05T18:41:13Z) - Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum
Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives.
We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
arXiv Detail & Related papers (2021-01-19T06:57:50Z) - Hartree-Fock on a superconducting qubit quantum computer [30.152226344347064]
Here, we perform a series of quantum simulations of chemistry the largest of which involved a dozen qubits, 78 two-qubit gates, and 114 one-qubit gates.
We model the binding energy of $rm H_6$, $rm H_8$, $rm H_10$ and $rm H_12$ chains as well as the isomerization of diazene.
We also demonstrate error-mitigation strategies based on $N$-representability which dramatically improve the effective fidelity of our experiments.
arXiv Detail & Related papers (2020-04-08T18:00:06Z)
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.