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

Information

A Systematic Benchmark of Quantum Support Vector Machines for Interpretable Attribution of AI-Generated Text

Kalin Kopanov, Tatiana V. Atanasova

Published Sep 11, 2026• 0 citations
Publisher

Abstract

Reliable attribution of artificial intelligence (AI)-generated text to a specific large language model (LLM) matters increasingly as LLMs proliferate, yet where quantum machine learning actually stands on this task has, to our knowledge, never been measured systematically. We benchmark the quantum support vector machine (QSVM) for binary attribution between Gemma 3 and Qwen 2.5 on a 5800-sample corpus from paired prompts: 83 configurations sweeping qubit count, regularization, training-set size, feature-map family, and circuit depth under exact, noiseless classical statevector simulation. QSVM validation accuracy plateaus at approximately 88%, whereas a classical support vector machine with a radial basis function kernel reaches approximately 97.8% on the identical fourteen-dimensional inputs: the ceiling belongs to the quantum (fidelity) kernel, not to the input representation. We measure the mechanism: off-diagonal quantum kernel values shrink exponentially with qubit count, the signature of exponential kernel concentration. The same classical model recovers the stylometric attribution fingerprint, showing it belongs to the shared feature pipeline rather than to the quantum kernel. All large-scale headline results generalize to an independent 1000-text test set produced after every design decision was frozen. The study provides a cautionary, reproducible benchmark for quantum kernel natural language processing and outlines an open-set extension as future work.

DOI
10.3390/info17090883

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

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

Practical application improvement to Quantum SVM: theory to practice

Park, Jae-Eun, Brian Quanz, Steve Wood +2 more

Quantum machine learning (QML) has emerged as an important area for Quantum applications, although useful QML applications would require many qubits. Therefore our paper is aimed at exploring the successful application of the Quantum Support Vector Machine (QSVM) algorithm while balancing several practical and technical considerations under the Noisy Intermediate-Scale Quantum (NISQ) assumption. For the quantum SVM under NISQ, we use quantum feature maps to translate data into quantum states and build the SVM kernel out of these quantum states, and further compare with classical SVM with radial basis function (RBF) kernels. As data sets are more complex or abstracted in some sense, classical SVM with classical kernels leads to less accuracy compared to QSVM, as classical SVM with typical classical kernels cannot easily separate different class data. Similarly, QSVM should be able to provide competitive performance over a broader range of data sets including ``simpler'' data cases in which smoother decision boundaries are required to avoid any model variance issues (i.e., overfitting). To bridge the gap between ``classical-looking'' decision boundaries and complex quantum decision boundaries, we propose to utilize general shallow unitary transformations to create feature maps with rotation factors to define a tunable quantum kernel, and added regularization to smooth the separating hyperplane model. We show in experiments that this allows QSVM to perform equally to SVM regardless of the complexity of the data sets and outperform in some commonly used reference data sets.

arXiv:2012.07725•Dec 14, 2020•27 citations

Support Vector Machine with a Scalable Quantum Kernel

Anant Agnihotri, Michael Krebsbach, Florentin Reiter +1 more

Quantum support vector machines are classification algorithms that rely on quantum-generated kernels. The fidelity quantum kernel commonly used in quantum support vector machines suffers from exponential concentration as system size increases, preventing an efficient scaling beyond fewqubit systems. We introduce the Hamming quantum kernel, a classical post-processing method that is based on the same measurement outcomes as the fidelity quantum kernel. However, it avoids the exponential concentration problem by using the full measurement statistics rather than a single fidelity value. We evaluate the approach on both classical data (MNIST) and synthetic data generated from quantum circuits, using systems ranging from 2 to 27 qubits. Throughout the simulations, the Hamming quantum kernel outperforms the fidelity quantum kernel whenever 15 or more qubits are used. Furthermore, for synthetic quantum data, our method consistently outperforms the classical Gaussian kernel. This demonstrates that the Hamming quantum kernel improves the expressivity and robustness at larger qubit scales without requiring any additional quantum ressources.

quant-pharXiv:2605.31449•Jun 1, 2026•0 citations

Empirical Evidence of Quantum Kernel Concentration in Few-Shot Keyword Spotting

Richard Caleb, Jagalingam Pushparaj

Quantum kernel methods utilize high-dimensional quantum feature spaces as a theoretically motivated strategy to address data scarcity in supervised classification. However, theoretical analyses predict exponential concentration of quantum kernel similarity values as qubit count increases. This study presents the first statistically controlled empirical evaluation of fixed-feature-map quantum support vector machines (QSVMs) for few-shot keyword spotting. The ZZFeatureMap and PauliFeatureMap circuits (2 to 3 qubits, PCA-compressed MFCC features, ~51% variance retained) were evaluated across 24 configurations and four low-resource regimes (5–30 samples per class) on the Google Speech Commands dataset, using ten independent seeds with Wilcoxon signed-rank tests and Bonferroni correction. Across all configurations and sample sizes, QSVM accuracy remained close to the five-class random baseline (19.3% at 30 samples per class; random baseline 20%), while RBF SVM achieved 38.7% and a compact CNN achieved 65.3%. Direct kernel similarity measurement confirmed severe concentration, where the 3-qubit QSVM produced near-identical same-class and different-class similarity means (both approximately 0.192), with 94.1% overlap. Under matched MFCC+PCA features, all classical kernels outperformed QSVM, including linear SVM (Cliff’s $\delta = -0.98$ , $p = 0.002$ ) and RBF SVM ( $\delta = -0.82$ , $p = 0.002$ , Bonferroni-corrected $\alpha = 0.003$ ), with CNN achieving complete stochastic dominance ( $\delta = -1.00$ ). These results empirically validate quantum kernel concentration in structured acoustic classification within evaluated NISQ constraints, and apply specifically to the fixed-feature-map paradigm, not quantum kernel methods in general. The identified failure modes, namely exponential concentration, geometric misalignment, and limited circuit expressivity, provide concrete directions for future research into trainable quantum feature maps and hybrid quantum-classical architectures.

IEEE Access•Jan 1, 2026•0 citations

Do We Really Need Quantum Machine Learning?: A Multidimensional Empirical Study

Sudip Vhaduri, Ryan Gammon, Sayanton Dibbo

The rapid growth of computer vision and increasingly complex image recognition tasks has exposed fundamental computational limitations of classical machine learning models, motivating the exploration of quantum computing as an emerging new paradigm. This paper presents a comprehensive benchmarking study of classical and quantum machine learning models for image recognition on the MNIST handwritten digit dataset, evaluating both traditional models, a Classical Support Vector Machine (CSVM) and a Quantum Support Vector Machine (QSVM), and deep neural network models, a Classical Convolutional Neural Network (CCNN) and a Quantum Convolutional Neural Network (QCNN), across four performance dimensions: classification accuracy, computational runtime, parameter count, and memory requirements. Experiments are conducted as functions of both feature dimensionality and sample size, and across CPU and GPU execution environments, providing a controlled, multidimensional comparison to address gaps in prior work. For the SVM-based models, QSVM consistently outperforms CSVM in accuracy, reaching $\sim$ 0.90 versus $\sim$ 0.85 at 1,000 samples, with a higher computational cost. A feature count of 10 qubits and a sample size in the range of 200 -- 500 emerge as practical operating points that balance accuracy and runtime. For the neural network models, CCNN and QCNN achieve comparable classification accuracy, both exceeding 0.96 at 64 features and 60,000 samples, yet QCNN offers superior parameter and memory efficiency at higher feature counts, while incurring higher runtime. Across both model families, quantum models consistently outperform classical models by greater margins in accuracy as feature dimensionality or sample size increases.

cs.CVCross-listedarXiv:2605.27923•May 28, 2026•0 citations
Reliable attribution of artificial intelligence (AI)-generated text to a specific large language model (LLM) matters increasingly as LLMs proliferate, yet where quantum machine learning actually stands on this task has, to our knowledge, never been measured systematically. We benchmark the quantum support vector machine (QSVM) for binary attribution between Gemma 3 and Qwen 2.5 on a 5800-sample corpus from paired prompts: 83 configurations sweeping qubit count, regularization, training-set size, feature-map family, and circuit depth under exact, noiseless classical statevector simulation. QSVM validation accuracy plateaus at approximately 88%, whereas a classical support vector machine with a radial basis function kernel reaches approximately 97.8% on the identical fourteen-dimensional inputs: the ceiling belongs to the quantum (fidelity) kernel, not to the input representation. We measure the mechanism: off-diagonal quantum kernel values shrink exponentially with qubit count, the signature of exponential kernel concentration. The same classical model recovers the stylometric attribution fingerprint, showing it belongs to the shared feature pipeline rather than to the quantum kernel. All large-scale headline results generalize to an independent 1000-text test set produced after every design decision was frozen. The study provides a cautionary, reproducible benchmark for quantum kernel natural language processing and outlines an open-set extension as future work.
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.
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.
Quantum machine learning (QML) has emerged as an important area for Quantum applications, although useful QML applications would require many qubits. Therefore our paper is aimed at exploring the successful application of the Quantum Support Vector Machine (QSVM) algorithm while balancing several practical and technical considerations under the Noisy Intermediate-Scale Quantum (NISQ) assumption. For the quantum SVM under NISQ, we use quantum feature maps to translate data into quantum states and build the SVM kernel out of these quantum states, and further compare with classical SVM with radial basis function (RBF) kernels. As data sets are more complex or abstracted in some sense, classical SVM with classical kernels leads to less accuracy compared to QSVM, as classical SVM with typical classical kernels cannot easily separate different class data. Similarly, QSVM should be able to provide competitive performance over a broader range of data sets including ``simpler'' data cases in which smoother decision boundaries are required to avoid any model variance issues (i.e., overfitting). To bridge the gap between ``classical-looking'' decision boundaries and complex quantum decision boundaries, we propose to utilize general shallow unitary transformations to create feature maps with rotation factors to define a tunable quantum kernel, and added regularization to smooth the separating hyperplane model. We show in experiments that this allows QSVM to perform equally to SVM regardless of the complexity of the data sets and outperform in some commonly used reference data sets.
Quantum support vector machines are classification algorithms that rely on quantum-generated kernels. The fidelity quantum kernel commonly used in quantum support vector machines suffers from exponential concentration as system size increases, preventing an efficient scaling beyond fewqubit systems. We introduce the Hamming quantum kernel, a classical post-processing method that is based on the same measurement outcomes as the fidelity quantum kernel. However, it avoids the exponential concentration problem by using the full measurement statistics rather than a single fidelity value. We evaluate the approach on both classical data (MNIST) and synthetic data generated from quantum circuits, using systems ranging from 2 to 27 qubits. Throughout the simulations, the Hamming quantum kernel outperforms the fidelity quantum kernel whenever 15 or more qubits are used. Furthermore, for synthetic quantum data, our method consistently outperforms the classical Gaussian kernel. This demonstrates that the Hamming quantum kernel improves the expressivity and robustness at larger qubit scales without requiring any additional quantum ressources.
Quantum kernel methods utilize high-dimensional quantum feature spaces as a theoretically motivated strategy to address data scarcity in supervised classification. However, theoretical analyses predict exponential concentration of quantum kernel similarity values as qubit count increases. This study presents the first statistically controlled empirical evaluation of fixed-feature-map quantum support vector machines (QSVMs) for few-shot keyword spotting. The ZZFeatureMap and PauliFeatureMap circuits (2 to 3 qubits, PCA-compressed MFCC features, ~51% variance retained) were evaluated across 24 configurations and four low-resource regimes (5–30 samples per class) on the Google Speech Commands dataset, using ten independent seeds with Wilcoxon signed-rank tests and Bonferroni correction. Across all configurations and sample sizes, QSVM accuracy remained close to the five-class random baseline (19.3% at 30 samples per class; random baseline 20%), while RBF SVM achieved 38.7% and a compact CNN achieved 65.3%. Direct kernel similarity measurement confirmed severe concentration, where the 3-qubit QSVM produced near-identical same-class and different-class similarity means (both approximately 0.192), with 94.1% overlap. Under matched MFCC+PCA features, all classical kernels outperformed QSVM, including linear SVM (Cliff’s δ=−0.98\delta = -0.98δ=−0.98 , p=0.002p = 0.002p=0.002 ) and RBF SVM ( δ=−0.82\delta = -0.82δ=−0.82 , p=0.002p = 0.002p=0.002 , Bonferroni-corrected α=0.003\alpha = 0.003α=0.003 ), with CNN achieving complete stochastic dominance ( δ=−1.00\delta = -1.00δ=−1.00 ). These results empirically validate quantum kernel concentration in structured acoustic classification within evaluated NISQ constraints, and apply specifically to the fixed-feature-map paradigm, not quantum kernel methods in general. The identified failure modes, namely exponential concentration, geometric misalignment, and limited circuit expressivity, provide concrete directions for future research into trainable quantum feature maps and hybrid quantum-classical architectures.
The rapid growth of computer vision and increasingly complex image recognition tasks has exposed fundamental computational limitations of classical machine learning models, motivating the exploration of quantum computing as an emerging new paradigm. This paper presents a comprehensive benchmarking study of classical and quantum machine learning models for image recognition on the MNIST handwritten digit dataset, evaluating both traditional models, a Classical Support Vector Machine (CSVM) and a Quantum Support Vector Machine (QSVM), and deep neural network models, a Classical Convolutional Neural Network (CCNN) and a Quantum Convolutional Neural Network (QCNN), across four performance dimensions: classification accuracy, computational runtime, parameter count, and memory requirements. Experiments are conducted as functions of both feature dimensionality and sample size, and across CPU and GPU execution environments, providing a controlled, multidimensional comparison to address gaps in prior work. For the SVM-based models, QSVM consistently outperforms CSVM in accuracy, reaching ∼\sim∼ 0.90 versus ∼\sim∼ 0.85 at 1,000 samples, with a higher computational cost. A feature count of 10 qubits and a sample size in the range of 200 -- 500 emerge as practical operating points that balance accuracy and runtime. For the neural network models, CCNN and QCNN achieve comparable classification accuracy, both exceeding 0.96 at 64 features and 60,000 samples, yet QCNN offers superior parameter and memory efficiency at higher feature counts, while incurring higher runtime. Across both model families, quantum models consistently outperform classical models by greater margins in accuracy as feature dimensionality or sample size increases.