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

International Conference on Innovations in Mechanical, Robotics, Computing and Biomedical Engineering (ICIMRBE)

Benchmarking Quantum Kernel Methods Against Classical Machine Learning for Multi-Morbidity Risk Prediction

Dhimant Tewari, Saanji Kohli, Nisha J.S., Gopinath Palanisamy, Goutham Veerapu

Published Aug 1, 2026• 0 citations
Publisher

Abstract

Multi-morbidity is the co-occurrence of conditions such as diabetes, cardiac arrhythmia, and hypertension in a single patient—poses a risk stratification problem that classical ensemble models address through high-capacity feature interactions. Quantum kernel methods offer a structurally different encoding: classical inputs are mapped to quantum states via parameterized circuits, and similarity is computed as state fidelity rather than through conventional dot-product kernels. Empirical validation of this approach on tabular clinical data remains limited. This work compares quantum kernel support vector machines (SVMs) using ZZ and Pauli feature maps against Random Forest, XGBoost, and polynomial-kernel SVM baselines on a synthesized multi-morbidity dataset under a few-shot learning protocol spanning training sizes n ∈ {50, 100, 200, 500}. The central finding is training-size invariance in quantum kernels: both the ZZ and Pauli implementations maintained approximately 74% accuracy across all four training sizes, whereas Random Forest improved from 81.8 ± 2.0% at n = 50 to 88.7 ± 1.0% at n = 500, with XGBoost exhibiting a similar trend. This invariance constitutes the primary empirical contribution of the study. The results suggest that quantum feature maps determine the embedding geometry at circuit construction time, yielding consistent kernel representations regardless of the number of labeled training samples. In scenarios where labeled clinical data is structurally limited, such stability may provide practical value, although it comes at a 7–15 percentage-point accuracy deficit relative to optimized ensemble methods. Quantum kernel training time increased to several hundred seconds at n = 500, while all classical baselines remained below one second. Under classical statevector simulation, this computational overhead represents the principal constraint on near-term deployment.

DOI
10.1109/icimrbe70745.2026.11710111

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

Evaluating Hybrid Quantum-Classical Models for Image Classification in the NISQ Era

Utku Binkanat

This thesis presents a systematic empirical evaluation of quantum machine learning performance under noisy intermediate-scale quantum (NISQ) era constraints. Through 670 controlled experiments, it evaluated quantum kernel support vector machines and variational quantum classifiers against classical baselines on MNIST binary and multiclass classification tasks with systematic variation of problem difficulty, feature dimensionality (4, 8 qubits), and training set size (n ∈{100, 250, 400, 500, 2000, 4000}). Statistical rigor was ensured through five random seeds per condition and comprehensive significance testing. During the testing with binary datasets, classical methods (SVM, logistic regression, k-NN, neural networks) achieved 85.9% to 99.6% accuracy with training times under one second across all sample sizes. Quantum kernel methods utilizing ZZ feature maps yielded 70.5% to 96.0% accuracy, requiring 129 to 2,140 seconds training with quadratic sample size scaling. Larger scale quantum experiments (n = 4000 for both architectures, 8-qubit encoding with n = 2000 for quantum kernels) proved computationally impossible on available hardware leading to out of memory errors, highlighting practical NISQ-era scalability constraints. Variational quantum classifiers exhibited persistent performance stagnation, failing to exceed 66.5% accuracy despite increases in training data and feature dimensionality. Performance gaps ranged from 3.3 to 35.2 percentage points. All quantum classical differences achieved statistical significance (p< 0.05, with 13 of 14 comparisons meeting p< 0.01) and exhibited large to very large efect sizes (d> 1.0, with 13 of 14 comparisons exceeding d> 2.0). To further evaluate performance and scalability, a 4 class classification experiment was conducted following an identical experimental protocol, with training set sizes of n ∈{100, 250, 400}. Across 180 runs, classical baselines achieved mean accuracies between 87.2% and 95% across both 4 and 8 dimensional data. Quantum Kernel SVM struggled during runs with 4 dimensions, accuracy varying between 64.6% and 74%. Quantum Kernel SVM accuracy declined 16%-25% when the dimension and qubit count were increased to 8, showing findings of exponential kernel concentration. The Variational Quantum Classifier also performed poorly, with accuracy ranging from 43.4% to 44.6% across all runs, providing further evidence that it failed to leverage additional features or training data. Experiments employed noiseless statevector simulation, establishing that quantum underperformance stems from fundamental algorithmic limitations independent of hardware noise. A further extension to 8 class classification (digits 0–7) confirmed and amplified these findings: classical methods maintained 65–83% accuracy while Quantum Kernel SVM degraded to 34–47% and VQC collapsed to 21–23%, approaching the 12.5% random baseline. Supplementary appendix experiments further examined amplitude encoding on raw 784 dimensional pixel features and an alternative angle encoding scheme on the 8-class task; the latter demonstrated that replacing the ZZ Feature Map with simple per qubit rotations substantially recovered quantum kernel performance, suggesting feature map design as a more consequential variable than circuit depth or qubit count in near-term quantum classification.

•Jan 1, 2026•0 citations

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

Quantum Kernel-based Machine Learning for Multi-Omic Stratification of Lung Cancer Subtypes

Jenolin J, Dhanasegar Narmadha, G. Naveen Sundar

Subtyping of lung cancer is crucial for individualized treatment and optimizing outcomes. Computational modeling allows data analysis over large scales, which helps in making precision classification in large datasets or high-dimensional datasets. Conventional machine learning methods perform well, but integration of multi-omic data (DNA, RNA, miRNA) is challenging in cancer subtyping because of high dimensionality and complex inter-omic relationships. To bypass this Quantum machine learning (QML) provides better ability to navigate high-dimensional biological data with many variables using quantum computational concepts that can identify fine patterns or small-scale patterns beyond the capability of classical approaches. Through the integration of quantum computing principles with the machine learning framework, the study highlights the improvement of computer technology. The framework shows how the system is optimized with the help of quantum principles, how it can improve accuracy, parallel processing and reducing latency. In this work, we have combined data on miRNA, RNA expression, and DNA methylation to create a complete workflow for classifying cancer. This method uses a wide variety of feature selection techniques, such as random forest-based selection, chi-square, mutual information(MI), and principal component analysis(PCA).In order to illustrate the notion of quantum advantage, we carefully compare the performance metrics of the Quantum Support Vector Classifier (QSVC) to the classical Support Vector Machine (SVM), using a ZZ feature map quantum kernel as our baseline for analysis. Using five-fold crossvalidation, we have also verified that the quantum has an advantage with consistently lower variance and higher accuracy.

International Conference on Evolutionary Computing and Mobile Sustainable Networks (ICECMSN)•Nov 24, 2025•1 citation

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

Do Quantum Kernels Improve Medical Image Classification? A Leakage-Controlled Benchmark Against Classical RBF-SVM

Dr. M. Usman Hashmi, M. Adnan Hashmi, Muazzam Ali +1 more

Quantum kernel methods are often proposed as a route to improved medical image classification because quantum feature maps can embed data into high-dimensional Hilbert spaces. However, their practical value remains unclear when compared with strong classical kernels under leakage-controlled conditions. This study benchmarks two simulated quantum kernel support vector machines, QSVM-ZZ and QSVM-Pauli, against logistic regression, linear SVM, fixed-default RBF-SVM, and a compact multi-layer perceptron on BrainTumorMRI and BreastMNIST. All models used identical frozen ResNet18 features, train-only standardisation, PCA compression to four and eight dimensions, three random seeds, and matched classifier-training budgets where applicable. Across 24 seed-level matched comparisons, the best quantum kernel model never outperformed the best classical model. The mean quantum-minus-classical macro-F1 gap was - 0.2230, with all 24 gaps negative. Fixed pairwise comparisons confirmed that RBF-SVM exceeded both quantum kernels individually. QSVMs also required approximately 50 × to more than 220 × higher runtime. These findings show that, for compressed ResNet18 medical image features under noiseless simulation, the tested QSVM-ZZ and QSVM-Pauli kernels did not provide a practical advantage over fixed-default RBF-SVM.

Journal of Imaging Informatics in Medicine•Sep 21, 2026•0 citations
Multi-morbidity is the co-occurrence of conditions such as diabetes, cardiac arrhythmia, and hypertension in a single patient—poses a risk stratification problem that classical ensemble models address through high-capacity feature interactions. Quantum kernel methods offer a structurally different encoding: classical inputs are mapped to quantum states via parameterized circuits, and similarity is computed as state fidelity rather than through conventional dot-product kernels. Empirical validation of this approach on tabular clinical data remains limited. This work compares quantum kernel support vector machines (SVMs) using ZZ and Pauli feature maps against Random Forest, XGBoost, and polynomial-kernel SVM baselines on a synthesized multi-morbidity dataset under a few-shot learning protocol spanning training sizes n ∈ {50, 100, 200, 500}. The central finding is training-size invariance in quantum kernels: both the ZZ and Pauli implementations maintained approximately 74% accuracy across all four training sizes, whereas Random Forest improved from 81.8 ± 2.0% at n = 50 to 88.7 ± 1.0% at n = 500, with XGBoost exhibiting a similar trend. This invariance constitutes the primary empirical contribution of the study. The results suggest that quantum feature maps determine the embedding geometry at circuit construction time, yielding consistent kernel representations regardless of the number of labeled training samples. In scenarios where labeled clinical data is structurally limited, such stability may provide practical value, although it comes at a 7–15 percentage-point accuracy deficit relative to optimized ensemble methods. Quantum kernel training time increased to several hundred seconds at n = 500, while all classical baselines remained below one second. Under classical statevector simulation, this computational overhead represents the principal constraint on near-term deployment.
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.
This thesis presents a systematic empirical evaluation of quantum machine learning performance under noisy intermediate-scale quantum (NISQ) era constraints. Through 670 controlled experiments, it evaluated quantum kernel support vector machines and variational quantum classifiers against classical baselines on MNIST binary and multiclass classification tasks with systematic variation of problem difficulty, feature dimensionality (4, 8 qubits), and training set size (n ∈{100, 250, 400, 500, 2000, 4000}). Statistical rigor was ensured through five random seeds per condition and comprehensive significance testing. During the testing with binary datasets, classical methods (SVM, logistic regression, k-NN, neural networks) achieved 85.9% to 99.6% accuracy with training times under one second across all sample sizes. Quantum kernel methods utilizing ZZ feature maps yielded 70.5% to 96.0% accuracy, requiring 129 to 2,140 seconds training with quadratic sample size scaling. Larger scale quantum experiments (n = 4000 for both architectures, 8-qubit encoding with n = 2000 for quantum kernels) proved computationally impossible on available hardware leading to out of memory errors, highlighting practical NISQ-era scalability constraints. Variational quantum classifiers exhibited persistent performance stagnation, failing to exceed 66.5% accuracy despite increases in training data and feature dimensionality. Performance gaps ranged from 3.3 to 35.2 percentage points. All quantum classical differences achieved statistical significance (p< 0.05, with 13 of 14 comparisons meeting p< 0.01) and exhibited large to very large efect sizes (d> 1.0, with 13 of 14 comparisons exceeding d> 2.0). To further evaluate performance and scalability, a 4 class classification experiment was conducted following an identical experimental protocol, with training set sizes of n ∈{100, 250, 400}. Across 180 runs, classical baselines achieved mean accuracies between 87.2% and 95% across both 4 and 8 dimensional data. Quantum Kernel SVM struggled during runs with 4 dimensions, accuracy varying between 64.6% and 74%. Quantum Kernel SVM accuracy declined 16%-25% when the dimension and qubit count were increased to 8, showing findings of exponential kernel concentration. The Variational Quantum Classifier also performed poorly, with accuracy ranging from 43.4% to 44.6% across all runs, providing further evidence that it failed to leverage additional features or training data. Experiments employed noiseless statevector simulation, establishing that quantum underperformance stems from fundamental algorithmic limitations independent of hardware noise. A further extension to 8 class classification (digits 0–7) confirmed and amplified these findings: classical methods maintained 65–83% accuracy while Quantum Kernel SVM degraded to 34–47% and VQC collapsed to 21–23%, approaching the 12.5% random baseline. Supplementary appendix experiments further examined amplitude encoding on raw 784 dimensional pixel features and an alternative angle encoding scheme on the 8-class task; the latter demonstrated that replacing the ZZ Feature Map with simple per qubit rotations substantially recovered quantum kernel performance, suggesting feature map design as a more consequential variable than circuit depth or qubit count in near-term quantum classification.
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.
Subtyping of lung cancer is crucial for individualized treatment and optimizing outcomes. Computational modeling allows data analysis over large scales, which helps in making precision classification in large datasets or high-dimensional datasets. Conventional machine learning methods perform well, but integration of multi-omic data (DNA, RNA, miRNA) is challenging in cancer subtyping because of high dimensionality and complex inter-omic relationships. To bypass this Quantum machine learning (QML) provides better ability to navigate high-dimensional biological data with many variables using quantum computational concepts that can identify fine patterns or small-scale patterns beyond the capability of classical approaches. Through the integration of quantum computing principles with the machine learning framework, the study highlights the improvement of computer technology. The framework shows how the system is optimized with the help of quantum principles, how it can improve accuracy, parallel processing and reducing latency. In this work, we have combined data on miRNA, RNA expression, and DNA methylation to create a complete workflow for classifying cancer. This method uses a wide variety of feature selection techniques, such as random forest-based selection, chi-square, mutual information(MI), and principal component analysis(PCA).In order to illustrate the notion of quantum advantage, we carefully compare the performance metrics of the Quantum Support Vector Classifier (QSVC) to the classical Support Vector Machine (SVM), using a ZZ feature map quantum kernel as our baseline for analysis. Using five-fold crossvalidation, we have also verified that the quantum has an advantage with consistently lower variance and higher accuracy.
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 kernel methods are often proposed as a route to improved medical image classification because quantum feature maps can embed data into high-dimensional Hilbert spaces. However, their practical value remains unclear when compared with strong classical kernels under leakage-controlled conditions. This study benchmarks two simulated quantum kernel support vector machines, QSVM-ZZ and QSVM-Pauli, against logistic regression, linear SVM, fixed-default RBF-SVM, and a compact multi-layer perceptron on BrainTumorMRI and BreastMNIST. All models used identical frozen ResNet18 features, train-only standardisation, PCA compression to four and eight dimensions, three random seeds, and matched classifier-training budgets where applicable. Across 24 seed-level matched comparisons, the best quantum kernel model never outperformed the best classical model. The mean quantum-minus-classical macro-F1 gap was - 0.2230, with all 24 gaps negative. Fixed pairwise comparisons confirmed that RBF-SVM exceeded both quantum kernels individually. QSVMs also required approximately 50 × to more than 220 × higher runtime. These findings show that, for compressed ResNet18 medical image features under noiseless simulation, the tested QSVM-ZZ and QSVM-Pauli kernels did not provide a practical advantage over fixed-default RBF-SVM.