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:2611.05442

Matched but Not Better: An Equivalence-Tested Benchmark of Quantum Machine Learning on Six Clinical Datasets and the QML-Health-READY Reporting Framework

Mohammed Siraj B, Gousia Habib, Ruban S

Published Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

Background: Quantum machine learning (QML) is promoted for clinical prediction, but comparisons with classical models are rarely paired or tested for equivalence. Methods: We compared a quantum-kernel support vector machine (QSVM; 4 qubits, tuned bandwidth) and a variational quantum classifier (VQC) with five tuned classical models across six public clinical datasets. All models used identical four-component inputs and 25 cross-validation splits. Paired AUROC differences were assessed using a corrected resampled t-test, Holm-adjusted equivalence tests (margins: +/-0.02 and +/-0.05), and random-effects pooling. Ablation, noise, finite-shot, and implementation-fault analyses were conducted. We propose QML-Health-READY, an eight-domain reporting framework. Results: Neither quantum model significantly outperformed any classical comparator. Pooled across datasets, QSVM differed from the kernel-matched radial basis function (RBF) SVM by -0.006 AUROC (95% CI: -0.017 to +0.004), equivalent to +/-0.02. VQC differed from the best classical model by -0.007 (95% CI: -0.019 to +0.004). QSVM was equivalent to RBF SVM within +/-0.05 in four of six datasets but was significantly worse than the best classical model on NHANES 2017-18 (-0.076). A classically trivial product-state kernel performed as well as the entangling kernel. With depolarizing noise (p = 0.01) and 1,024 shots per kernel entry, QSVM AUROC decreased by 0.054 (95% CI: 0.036 to 0.071). Untuned bandwidth produced near-chance AUROC (0.48-0.59). Conclusions: Correctly configured quantum classifiers approached but did not exceed tuned classical models. Finite-shot estimation, rather than gate noise, was their main practical cost, while configuration errors could reverse conclusions. QML-Health-READY defines reporting requirements for credible claims.

DOI
10.48550/arxiv.2611.05442

Related papers

Rigorous Benchmarking of Variational Quantum Classifiers for Cancer Classification: Encoding Bandwidth and a Matched, Tuned Repeated Cross-Validation Study

B RAVI KIRAN PATNAIK

Variational quantum classifiers (VQCs) are often compared with classical models under unequal data partitions, tuning budgets, or statistical treatment. We benchmark a 4-qubit VQC against logistic regression, an RBF-SVM, random forest, a quantum-kernel SVM (QSVM), and a majority-class control on Breast Cancer Wisconsin (n=569), Coimbra (n=116), and Golub leukemia (n=72), using five stratified folds across five seeds (25 paired blocks per dataset), identical training-fold-fitted preprocessing, and Nadeau–Bengio corrected paired tests with Holm correction. A first arm with a frozen configuration and the common [0, π] angle encoding left the VQC at 0.563, 0.515, and 0.576 accuracy (majority 0.617, 0.552, 0.652). In a second arm, in which every model was tuned by the same inner cross-validation and the encoding scale was a tuned hyperparameter, VQC accuracy rose to 0.864, 0.616, and 0.747. On Wisconsin the VQC stayed significantly below every matched classical model (differences 0.079–0.097, Holm p≤0.006) but above the majority class; on Golub it was significantly below only the SVM (Holm p=0.016); on Coimbra no comparison was significant. A QSVM with the same feature map exceeded the VQC numerically on every dataset, and three optimizers reached the same training loss in pilot diagnostics, pointing to the encoding and the variational head rather than the optimizer. The Wisconsin arms also differ in sample size (120 versus 569). Results apply to this low-qubit, PCA-compressed, exactly simulated setting and do not indicate a quantum advantage.

•Oct 1, 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

Comparative Study of Quantum and Classical Machine Learning Models in Binary Classification

Anand Kumar Mishra, Ramanuj Awasthi

A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.

quant-pharXiv:2609.23476•Sep 22, 2026•0 citations

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•6 citations

Quantum Kernel Advantage over Classical Collapse in Medical Foundation Model Embeddings

Sebastian Cajas Ordóñez, Felipe Ocampo Osorio, Dax Enshan Koh +10 more

We provide evidence of quantum kernel advantage under noiseless simulation in binary insurance classification on MIMIC-CXR chest radiographs using quantum support vector machines (QSVM) with frozen embeddings from three medical foundation models (MedSigLIP-448, RAD-DINO, ViT-patch32). We propose a two-tier fair comparison framework in which both classifiers receive identical PCA-q features. At Tier 1 (untuned QSVM vs. untuned linear SVM, C = 1 both sides), QSVM wins minority-class F1 in all 18 tested configurations (17 at p < 0.001, 1 at p < 0.01). The classical linear kernel collapses to majority-class prediction on 90-100% of seeds at every qubit count, while QSVM maintains non-trivial recall. At q = 11 (MedSigLIP-448 plateau center), QSVM achieves mean F1 = 0.343 vs. classical F1 = 0.050 (F1 gain = +0.293, p < 0.001) without hyperparameter tuning. Under Tier 2 (untuned QSVM vs. C-tuned RBF SVM), QSVM wins all seven tested configurations (mean gain +0.068, max +0.112). Eigenspectrum analysis reveals quantum kernel effective rank reaches 69.80 at q = 11, far exceeding linear kernel rank, while classical collapse remains C-invariant. A full qubit sweep reveals architecture-dependent concentration onset across models. Code: https://github.com/sebasmos/qml-medimage

quant-pharXiv:2604.24597•Apr 28, 2026•1 citation

Why Classical-Quantum Machine Learning Works Better Than Classical Machine Learning

Abdullah Md Raihan Chy, Md. Farhan Shahriyar

Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris$(100 \%)$and Wine$(92 \%)$. All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)•Apr 16, 2026•1 citation
Background: Quantum machine learning (QML) is promoted for clinical prediction, but comparisons with classical models are rarely paired or tested for equivalence. Methods: We compared a quantum-kernel support vector machine (QSVM; 4 qubits, tuned bandwidth) and a variational quantum classifier (VQC) with five tuned classical models across six public clinical datasets. All models used identical four-component inputs and 25 cross-validation splits. Paired AUROC differences were assessed using a corrected resampled t-test, Holm-adjusted equivalence tests (margins: +/-0.02 and +/-0.05), and random-effects pooling. Ablation, noise, finite-shot, and implementation-fault analyses were conducted. We propose QML-Health-READY, an eight-domain reporting framework. Results: Neither quantum model significantly outperformed any classical comparator. Pooled across datasets, QSVM differed from the kernel-matched radial basis function (RBF) SVM by -0.006 AUROC (95% CI: -0.017 to +0.004), equivalent to +/-0.02. VQC differed from the best classical model by -0.007 (95% CI: -0.019 to +0.004). QSVM was equivalent to RBF SVM within +/-0.05 in four of six datasets but was significantly worse than the best classical model on NHANES 2017-18 (-0.076). A classically trivial product-state kernel performed as well as the entangling kernel. With depolarizing noise (p = 0.01) and 1,024 shots per kernel entry, QSVM AUROC decreased by 0.054 (95% CI: 0.036 to 0.071). Untuned bandwidth produced near-chance AUROC (0.48-0.59). Conclusions: Correctly configured quantum classifiers approached but did not exceed tuned classical models. Finite-shot estimation, rather than gate noise, was their main practical cost, while configuration errors could reverse conclusions. QML-Health-READY defines reporting requirements for credible claims.
Variational quantum classifiers (VQCs) are often compared with classical models under unequal data partitions, tuning budgets, or statistical treatment. We benchmark a 4-qubit VQC against logistic regression, an RBF-SVM, random forest, a quantum-kernel SVM (QSVM), and a majority-class control on Breast Cancer Wisconsin (n=569), Coimbra (n=116), and Golub leukemia (n=72), using five stratified folds across five seeds (25 paired blocks per dataset), identical training-fold-fitted preprocessing, and Nadeau–Bengio corrected paired tests with Holm correction. A first arm with a frozen configuration and the common [0, π] angle encoding left the VQC at 0.563, 0.515, and 0.576 accuracy (majority 0.617, 0.552, 0.652). In a second arm, in which every model was tuned by the same inner cross-validation and the encoding scale was a tuned hyperparameter, VQC accuracy rose to 0.864, 0.616, and 0.747. On Wisconsin the VQC stayed significantly below every matched classical model (differences 0.079–0.097, Holm p≤0.006) but above the majority class; on Golub it was significantly below only the SVM (Holm p=0.016); on Coimbra no comparison was significant. A QSVM with the same feature map exceeded the VQC numerically on every dataset, and three optimizers reached the same training loss in pilot diagnostics, pointing to the encoding and the variational head rather than the optimizer. The Wisconsin arms also differ in sample size (120 versus 569). Results apply to this low-qubit, PCA-compressed, exactly simulated setting and do not indicate a quantum advantage.
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.
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
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.
We provide evidence of quantum kernel advantage under noiseless simulation in binary insurance classification on MIMIC-CXR chest radiographs using quantum support vector machines (QSVM) with frozen embeddings from three medical foundation models (MedSigLIP-448, RAD-DINO, ViT-patch32). We propose a two-tier fair comparison framework in which both classifiers receive identical PCA-q features. At Tier 1 (untuned QSVM vs. untuned linear SVM, C = 1 both sides), QSVM wins minority-class F1 in all 18 tested configurations (17 at p < 0.001, 1 at p < 0.01). The classical linear kernel collapses to majority-class prediction on 90-100% of seeds at every qubit count, while QSVM maintains non-trivial recall. At q = 11 (MedSigLIP-448 plateau center), QSVM achieves mean F1 = 0.343 vs. classical F1 = 0.050 (F1 gain = +0.293, p < 0.001) without hyperparameter tuning. Under Tier 2 (untuned QSVM vs. C-tuned RBF SVM), QSVM wins all seven tested configurations (mean gain +0.068, max +0.112). Eigenspectrum analysis reveals quantum kernel effective rank reaches 69.80 at q = 11, far exceeding linear kernel rank, while classical collapse remains C-invariant. A full qubit sweep reveals architecture-dependent concentration onset across models. Code: https://github.com/sebasmos/qml-medimage
Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris(100%)(100 \%)(100%)and Wine(92%)(92 \%)(92%). All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.