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

Computer Modeling in Engineering & Sciences

Quantum Kernels for Text Classification: A Statistical and Diagnostic Framework Revealing the Low-Data Regime

Mrugendrasinh L. Rahevar, Martin Parmar, Hemant Yadav, Chun-Ta Li, Agbotiname Lucky Imoize, Hiren Mewada

Published Jan 1, 2026• 0 citations
Publisher

Abstract

Quantum kernel techniques aim to leverage quantum computational capabilities on social data. However, their application to natural language processing tasks faces formidable obstacles, such as extreme dimensionality reduction (D=384→k=8), concentration of measure in quantum feature spaces, and the lack of theoretical understanding of when quantum advantages occur in kernel-based text classification. Filling this gap, we provide a comprehensive study of quantum kernels for text classification that addresses three major challenges in existing studies: general data compression approaches that ignore class structure, the lack of a predictive diagnostic toolkit, and overlooked approaches for handling concentration effects. Our main contributions include a supervised contrastive data compression approach with theoretical guarantees of kernel alignment, a five-diagnostic toolkit connecting theoretical insights with practical performance, the discovery of a small-data regime (n≤200) in which quantum methods perform comparably to classical approaches, and a transparent demonstration that quantum kernels require carefully designed settings to remain competitive with classical counterparts. Across four datasets, evaluated using five random seeds and exact paired statistical testing, we observe that quantum projected kernels achieve an accuracy of 84.5% compared to 85.1% for the classical RBF kernel (p>0.05, not statistically significant) under supervised compression settings. However, quantum methods lag behind by approximately 2%–4% at larger scales due to concentration effects, reflected in reduced off-diagonal kernel variance (0.003 vs. 0.025).

DOI
10.32604/cmes.2026.085393

Related papers

Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation

Siavash Kakavand, Christoph Strohmeyer, Michael Schlotter

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.

quant-pharXiv:2604.18837•Apr 22, 2026•0 citations

A Versatile Variational Quantum Kernel Framework for Non-Trivial Classification

Jiang Yuhan, Matthew Otten

Quantum kernel methods are a promising branch of quantum machine learning, but their per- formance across data types and encoding choices remains incompletely understood. To address this gap, we developed an algorithmic framework for variational quantum kernels utilizing resource- efficient ansätze for complex classification tasks and introduced a parameter scaling technique to accelerate convergence. We conducted a comprehensive benchmark of this framework on eight chal- lenging, real-world and high-dimensional datasets covering tabular, image, time series, and graph data. Our results show that the proposed quantum kernel demonstrated competitive classification accuracy compared to standard classical kernels in classical simulation, such as the radial basis function (RBF) kernel. This work demonstrates that properly designed quantum kernels can func- tion as versatile, high-performance tools, laying a foundation for quantum-enhanced applications in machine learning. Further research is needed to fully assess the practical performance of quantum methods.

cs.LGCross-listedarXiv:2511.10831•Nov 17, 2025•0 citations

Empirical Evaluation of Quantum Kernel Methods for Classification: A Comparative Study with Classical Kernels

Ronak Bhalgami

Quantum kernel methods are the most concrete near-term proposal for quantum machine learning on classical data, yet published benchmarks disagree on whether they outperform tuned classical kernels, and the disagreement cannot be resolved from the literature because the comparisons are not protocol-controlled. We argue that the obstacle is one of measurement, not theory: the usual setup fixes the quantum feature map's data scaling while grid-searching the classical kernel's hyperparameters, recomputes nothing per fold, and reports cost in simulator time. We therefore treat the comparison itself as the object of study and impose three controls. The bandwidth is tuned on the same grid budget as the classical $γ$, the kernel is recomputed inside every fold from fold-fitted preprocessing, and cost is counted in hardware circuit evaluations. On top of these we run a factorial design of 324 cells in which dimensionality, training size, class separability and data structure are explicit covariates, together with four standard datasets, a shots-versus-gate-noise ablation, and a cost sweep. The dominant effect we measure is not quantum: tuning the feature map's bandwidth is worth 0.120 accuracy on synthetic data and 0.339 on real data, exceeding every quantum-classical difference we observe. Tuned quantum kernels are then statistically indistinguishable from a tuned RBF on all four real datasets. The advantage on synthetic data is confined almost entirely to data generated by the feature map itself, and it shrinks with dimensionality (-0.0045 per qubit) while growing with sample size. Finite sampling costs an order of magnitude more accuracy than gate and readout noise, and a fidelity kernel needs $5\times10^{7}$ circuits at n = 10,000. Protocol variance is thus sufficient to explain the field's contradictory conclusions.

quant-pharXiv:2610.42029•Nov 2, 2026

Exploring Traditional Methods And Quantum-Based Approaches In Text Classification: A Comprehensive Study On Natural Language Processing

Mohammad Danish, Ruchika Aggarwal, Jagrati Malviya

This paper presents a comprehensive study comparing traditional techniques with quantum- based approaches in the realm of natural language processing (NLP) for text classification. We delve into the effectiveness and limitations of both methodologies, analyzing their performance across various datasets and benchmarking criteria. Through empirical evaluations, we highlight the advantages and challenges associated with each approach, providing insights into their applicability and potential for improving text classification tasks. By synthesizing findings from existing literature and experimental results, this study aims to contribute to the ongoing discourse on advancing NLP techniques for enhanced text classification.

Journal of Pharmaceutical Negative Results•Apr 14, 2022•0 citations

Non-variational supervised quantum kernel methods: a review

John Tanner, Chon-Fai Kam, Jingbo Wang

Quantum kernel methods (QKMs) have emerged as a prominent framework for supervised quantum machine learning. Unlike variational quantum algorithms, which rely on gradient-based optimisation and may suffer from issues such as barren plateaus, non-variational QKMs employ fixed quantum feature maps, with model selection performed classically via convex optimisation and cross-validation. This separation of quantum feature embedding from classical training ensures stable optimisation while leveraging quantum circuits to encode data in high-dimensional Hilbert spaces. In this review, we provide a thorough analysis of non-variational supervised QKMs, covering their foundations in classical kernel theory, constructions of fidelity and projected quantum kernels, and methods for their estimation in practice. We examine frameworks for assessing quantum advantage, including generalisation bounds and necessary conditions for separation from classical models, and analyse key challenges such as exponential concentration, dequantisation via tensor-network methods, and the spectral properties of kernel integral operators. We further discuss structured problem classes that may enable advantage, and synthesise insights from comparative and hardware studies. Overall, this review aims to clarify the regimes in which QKMs may offer genuine advantages, and to delineate the conceptual, methodological, and technical obstacles that must be overcome for practical quantum-enhanced learning.

quant-pharXiv:2604.07896•Apr 10, 2026•0 citations

Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data (Code & Data)

Siavash Kakavand, Christoph Strohmeyer, Michael Schlotter

Reproducibility archive (code + manuscript) for the paper "Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation" (arXiv:2604.18837). The archive contains the full Python benchmark framework, experiment configurations, unit tests, and the compiled manuscript. 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; (ii) learning curve analysis; (iii) hardware validation on IBM ibm_fez (Heron r2); and (iv) seed sensitivity analysis. 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 (RBF). The complete benchmark suite is publicly available to facilitate reproduction and extension.

•Apr 1, 2026•0 citations
Quantum kernel techniques aim to leverage quantum computational capabilities on social data. However, their application to natural language processing tasks faces formidable obstacles, such as extreme dimensionality reduction (D=384→k=8), concentration of measure in quantum feature spaces, and the lack of theoretical understanding of when quantum advantages occur in kernel-based text classification. Filling this gap, we provide a comprehensive study of quantum kernels for text classification that addresses three major challenges in existing studies: general data compression approaches that ignore class structure, the lack of a predictive diagnostic toolkit, and overlooked approaches for handling concentration effects. Our main contributions include a supervised contrastive data compression approach with theoretical guarantees of kernel alignment, a five-diagnostic toolkit connecting theoretical insights with practical performance, the discovery of a small-data regime (n≤200) in which quantum methods perform comparably to classical approaches, and a transparent demonstration that quantum kernels require carefully designed settings to remain competitive with classical counterparts. Across four datasets, evaluated using five random seeds and exact paired statistical testing, we observe that quantum projected kernels achieve an accuracy of 84.5% compared to 85.1% for the classical RBF kernel (p>0.05, not statistically significant) under supervised compression settings. However, quantum methods lag behind by approximately 2%–4% at larger scales due to concentration effects, reflected in reduced off-diagonal kernel variance (0.003 vs. 0.025).
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α= 0.05α=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≥0.976r \geq 0.976r≥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 (ε2=0.73\varepsilon^2 = 0.73ε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.
Quantum kernel methods are a promising branch of quantum machine learning, but their per- formance across data types and encoding choices remains incompletely understood. To address this gap, we developed an algorithmic framework for variational quantum kernels utilizing resource- efficient ansätze for complex classification tasks and introduced a parameter scaling technique to accelerate convergence. We conducted a comprehensive benchmark of this framework on eight chal- lenging, real-world and high-dimensional datasets covering tabular, image, time series, and graph data. Our results show that the proposed quantum kernel demonstrated competitive classification accuracy compared to standard classical kernels in classical simulation, such as the radial basis function (RBF) kernel. This work demonstrates that properly designed quantum kernels can func- tion as versatile, high-performance tools, laying a foundation for quantum-enhanced applications in machine learning. Further research is needed to fully assess the practical performance of quantum methods.
Quantum kernel methods are the most concrete near-term proposal for quantum machine learning on classical data, yet published benchmarks disagree on whether they outperform tuned classical kernels, and the disagreement cannot be resolved from the literature because the comparisons are not protocol-controlled. We argue that the obstacle is one of measurement, not theory: the usual setup fixes the quantum feature map's data scaling while grid-searching the classical kernel's hyperparameters, recomputes nothing per fold, and reports cost in simulator time. We therefore treat the comparison itself as the object of study and impose three controls. The bandwidth is tuned on the same grid budget as the classical γγγ, the kernel is recomputed inside every fold from fold-fitted preprocessing, and cost is counted in hardware circuit evaluations. On top of these we run a factorial design of 324 cells in which dimensionality, training size, class separability and data structure are explicit covariates, together with four standard datasets, a shots-versus-gate-noise ablation, and a cost sweep. The dominant effect we measure is not quantum: tuning the feature map's bandwidth is worth 0.120 accuracy on synthetic data and 0.339 on real data, exceeding every quantum-classical difference we observe. Tuned quantum kernels are then statistically indistinguishable from a tuned RBF on all four real datasets. The advantage on synthetic data is confined almost entirely to data generated by the feature map itself, and it shrinks with dimensionality (-0.0045 per qubit) while growing with sample size. Finite sampling costs an order of magnitude more accuracy than gate and readout noise, and a fidelity kernel needs 5×1075\times10^{7}5×107 circuits at n = 10,000. Protocol variance is thus sufficient to explain the field's contradictory conclusions.
This paper presents a comprehensive study comparing traditional techniques with quantum- based approaches in the realm of natural language processing (NLP) for text classification. We delve into the effectiveness and limitations of both methodologies, analyzing their performance across various datasets and benchmarking criteria. Through empirical evaluations, we highlight the advantages and challenges associated with each approach, providing insights into their applicability and potential for improving text classification tasks. By synthesizing findings from existing literature and experimental results, this study aims to contribute to the ongoing discourse on advancing NLP techniques for enhanced text classification.
Quantum kernel methods (QKMs) have emerged as a prominent framework for supervised quantum machine learning. Unlike variational quantum algorithms, which rely on gradient-based optimisation and may suffer from issues such as barren plateaus, non-variational QKMs employ fixed quantum feature maps, with model selection performed classically via convex optimisation and cross-validation. This separation of quantum feature embedding from classical training ensures stable optimisation while leveraging quantum circuits to encode data in high-dimensional Hilbert spaces. In this review, we provide a thorough analysis of non-variational supervised QKMs, covering their foundations in classical kernel theory, constructions of fidelity and projected quantum kernels, and methods for their estimation in practice. We examine frameworks for assessing quantum advantage, including generalisation bounds and necessary conditions for separation from classical models, and analyse key challenges such as exponential concentration, dequantisation via tensor-network methods, and the spectral properties of kernel integral operators. We further discuss structured problem classes that may enable advantage, and synthesise insights from comparative and hardware studies. Overall, this review aims to clarify the regimes in which QKMs may offer genuine advantages, and to delineate the conceptual, methodological, and technical obstacles that must be overcome for practical quantum-enhanced learning.
Reproducibility archive (code + manuscript) for the paper "Benchmarking Quantum Kernel Support Vector Machines Against Classical Baselines on Tabular Data: A Rigorous Empirical Study with Hardware Validation" (arXiv:2604.18837). The archive contains the full Python benchmark framework, experiment configurations, unit tests, and the compiled manuscript. 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; (ii) learning curve analysis; (iii) hardware validation on IBM ibm_fez (Heron r2); and (iv) seed sensitivity analysis. A Kruskal–Wallis factorial analysis reveals that dataset choice dominates performance variance (ε2=0.73\varepsilon^2 = 0.73ε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 (RBF). The complete benchmark suite is publicly available to facilitate reproduction and extension.