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

Evaluating the Impact of Different Quantum Kernels on the Classification Performance of Support Vector Machine Algorithm: A Medical Dataset Application

Emine Akpinar, Sardar M. N. Islam, Murat Oduncuoğlu

Published Jul 13, 2024• 25 citations
arXivHTMLPDF

Abstract

The support vector machine algorithm with a quantum kernel estimator (QSVM-Kernel), as a leading example of a quantum machine learning technique, has undergone significant advancements. Nevertheless, its integration with classical data presents unique challenges. While quantum computers primarily interact with data in quantum states, embedding classical data into quantum states using feature mapping techniques is essential for leveraging quantum algorithms Despite the recognized importance of feature mapping, its specific impact on data classification outcomes remains largely unexplored. This study addresses this gap by comprehensively assessing the effects of various feature mapping methods on classification results, taking medical data analysis as a case study. In this study, the QSVM-Kernel method was applied to classification problems in two different and publicly available medical datasets, namely, the Wisconsin Breast Cancer (original) and The Cancer Genome Atlas (TCGA) Glioma datasets. In the QSVM-Kernel algorithm, quantum kernel matrices obtained from 9 different quantum feature maps were used. Thus, the effects of these quantum feature maps on the classification results of the QSVM-Kernel algorithm were examined in terms of both classifier performance and total execution time. As a result, in the Wisconsin Breast Cancer (original) and TCGA Glioma datasets, when Rx and Ry rotational gates were used, respectively, as feature maps in the QSVM-Kernel algorithm, the best classification performances were achieved both in terms of classification performance and total execution time. The contributions of this study are that (1) it highlights the significant impact of feature mapping techniques on medical data classification outcomes using the QSVM-Kernel algorithm, and (2) it also guides undertaking research for improved QSVM classification performance.

DOI
10.48550/arxiv.2407.09930

Related papers

Investigating Quantum Feature Maps in Quantum Support Vector Machines for Lung Cancer Classification

Achraf Toufah, MA Kadim, Moulay Youssef El Hafidi

Background: Classical algorithms often struggle with the high dimensionality of medical data critical for early lung cancer diagnosis. While Quantum Machine Learning (QML) offers enhanced pattern recognition capabilities, the impact of specific quantum feature encoding strategies on diagnostic accuracy remains underexplored.Methods: We evaluated Quantum Support Vector Machines (QSVM) using a dataset of 309 lung cancer patients, divided into six balanced subsets to mitigate class imbalance. Models were implemented on a qasm simulator, comparing three encoding strategies: ZFeatureMap, ZZFeatureMap, and PauliFeatureMap. Performance was assessed using standard classification metrics.Results: The choice of feature map significantly influenced model efficacy. The PauliFeatureMap outperformed other kernels, achieving 100% classification accuracy in three of the six subsets, whereas ZFeatureMap and ZZFeatureMap yielded lower predictive consistency.Conclusion: Quantum feature map selection is a decisive factor in QSVM performance. Specifically, the PauliFeatureMap demonstrates high separability for medical data, highlighting the potential of optimized quantum kernels to improve diagnostic precision.

arXiv:2506.03272•Journal of Artificial Intelligence Research and Innovation•Dec 29, 2025•11 citations

Pancreatic Cancer Data Classification with Quantum Machine Learning

Amit Kumar Saxena, Smita Saxena

Quantum computing is a promising new approach to tackle the complex real-world computational problems by harnessing the power of quantum mechanics principles. The inherent parallelism and exponential computational power of quantum systems hold the potential to outpace classical counterparts in solving complex optimization problems, which are pervasive in machine learning. Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm inspired by classical Support Vector Machine (SVM) that exploits quantum parallelism to efficiently classify data points in high-dimensional feature spaces. We provide a comprehensive overview of the underlying principles of QSVM, elucidating how different quantum feature maps and quantum kernels enable the manipulation of quantum states to perform classification tasks. Through a comparative analysis, we reveal the quantum advantage achieved by these algorithms in terms of speedup and solution quality. As a case study, we explored the potential of quantum paradigms in the context of a real-world problem: classifying pancreatic cancer biomarker data. The Support Vector Classifier (SVC) algorithm was employed for the classical approach while the QSVM algorithm was executed on a quantum simulator provided by the Qiskit quantum computing framework. The classical approach as well as the quantum-based techniques reported similar accuracy. This uniformity suggests that these methods effectively captured similar underlying patterns in the dataset. Remarkably, quantum implementations exhibited substantially reduced execution times demonstrating the potential of quantum approaches in enhancing classification efficiency. This affirms the growing significance of quantum computing as a transformative tool for augmenting machine learning paradigms and also underscores the potency of quantum execution for computational acceleration.

Journal of quantum computing•Jan 1, 2023•10 citations

Design and Implementation of Kernel-Based Quantum Classification Algorithms for Data Analysis in Software Engineering using Quantum Support Vector Machine (QSVM)

M. Zakki Abdillah, Devi Astri Nawangnugraeni

With the increasing complexity of projects and the volume of data in Software Engineering (SE), the need for efficient and accurate data analysis techniques has become crucial. Classification algorithms play a vital role in various SE tasks, such as bug detection, software quality prediction, and requirements classification. Quantum computing offers a new paradigm with the potential to overcome classical computational limitations for certain types of problems. This research proposes the design and implementation of a kernel-based quantum classification algorithm (also known as Quantum Support Vector Machine - QSVM) tailored for data analysis in the SE domain. We will discuss the fundamental principles behind quantum feature mapping and quantum kernel matrices, and demonstrate its implementation using quantum computing libraries. As a case study, the designed algorithm will be tested on a software bug detection dataset, comparing its performance with classical kernel-based classification algorithms like Support Vector Machine (SVM). The result of the comparison show that QSVM is superior in terms of accuracy, precision, recall, and F1-score compared to SVM.

Jurnal Teknik Informatika (Jutif)•Oct 22, 2025•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 Theory Approach to Performance Enhancement in Machine Learning

Marion O. Adebiyi, Deborah Olaniyan, Francis Bukie Osang +1 more

Quantum support vector machines (QSVMs) are a novel approach for solving classification problems, combining the principles of quantum computing with the support vector machine algorithm. In this study, we applied a QSVM to the Breast Cancer Wisconsin (Original) data set to classify tumors as benign or malignant. Our results showed that the QSVM outperformed classical support vector machines in terms of classification accuracy, achieving a success rate of 100% while classical SVM shows almost perfect result with its accuracy 95%. Additionally, the QSVM required significantly less training time compared to the classical SVM. These results demonstrate the potential of QSVMs for solving complex classification problems in the field of medical diagnosis.

International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG)•Apr 5, 2023•6 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
The support vector machine algorithm with a quantum kernel estimator (QSVM-Kernel), as a leading example of a quantum machine learning technique, has undergone significant advancements. Nevertheless, its integration with classical data presents unique challenges. While quantum computers primarily interact with data in quantum states, embedding classical data into quantum states using feature mapping techniques is essential for leveraging quantum algorithms Despite the recognized importance of feature mapping, its specific impact on data classification outcomes remains largely unexplored. This study addresses this gap by comprehensively assessing the effects of various feature mapping methods on classification results, taking medical data analysis as a case study. In this study, the QSVM-Kernel method was applied to classification problems in two different and publicly available medical datasets, namely, the Wisconsin Breast Cancer (original) and The Cancer Genome Atlas (TCGA) Glioma datasets. In the QSVM-Kernel algorithm, quantum kernel matrices obtained from 9 different quantum feature maps were used. Thus, the effects of these quantum feature maps on the classification results of the QSVM-Kernel algorithm were examined in terms of both classifier performance and total execution time. As a result, in the Wisconsin Breast Cancer (original) and TCGA Glioma datasets, when Rx and Ry rotational gates were used, respectively, as feature maps in the QSVM-Kernel algorithm, the best classification performances were achieved both in terms of classification performance and total execution time. The contributions of this study are that (1) it highlights the significant impact of feature mapping techniques on medical data classification outcomes using the QSVM-Kernel algorithm, and (2) it also guides undertaking research for improved QSVM classification performance.
Background: Classical algorithms often struggle with the high dimensionality of medical data critical for early lung cancer diagnosis. While Quantum Machine Learning (QML) offers enhanced pattern recognition capabilities, the impact of specific quantum feature encoding strategies on diagnostic accuracy remains underexplored.Methods: We evaluated Quantum Support Vector Machines (QSVM) using a dataset of 309 lung cancer patients, divided into six balanced subsets to mitigate class imbalance. Models were implemented on a qasm simulator, comparing three encoding strategies: ZFeatureMap, ZZFeatureMap, and PauliFeatureMap. Performance was assessed using standard classification metrics.Results: The choice of feature map significantly influenced model efficacy. The PauliFeatureMap outperformed other kernels, achieving 100% classification accuracy in three of the six subsets, whereas ZFeatureMap and ZZFeatureMap yielded lower predictive consistency.Conclusion: Quantum feature map selection is a decisive factor in QSVM performance. Specifically, the PauliFeatureMap demonstrates high separability for medical data, highlighting the potential of optimized quantum kernels to improve diagnostic precision.
Quantum computing is a promising new approach to tackle the complex real-world computational problems by harnessing the power of quantum mechanics principles. The inherent parallelism and exponential computational power of quantum systems hold the potential to outpace classical counterparts in solving complex optimization problems, which are pervasive in machine learning. Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm inspired by classical Support Vector Machine (SVM) that exploits quantum parallelism to efficiently classify data points in high-dimensional feature spaces. We provide a comprehensive overview of the underlying principles of QSVM, elucidating how different quantum feature maps and quantum kernels enable the manipulation of quantum states to perform classification tasks. Through a comparative analysis, we reveal the quantum advantage achieved by these algorithms in terms of speedup and solution quality. As a case study, we explored the potential of quantum paradigms in the context of a real-world problem: classifying pancreatic cancer biomarker data. The Support Vector Classifier (SVC) algorithm was employed for the classical approach while the QSVM algorithm was executed on a quantum simulator provided by the Qiskit quantum computing framework. The classical approach as well as the quantum-based techniques reported similar accuracy. This uniformity suggests that these methods effectively captured similar underlying patterns in the dataset. Remarkably, quantum implementations exhibited substantially reduced execution times demonstrating the potential of quantum approaches in enhancing classification efficiency. This affirms the growing significance of quantum computing as a transformative tool for augmenting machine learning paradigms and also underscores the potency of quantum execution for computational acceleration.
With the increasing complexity of projects and the volume of data in Software Engineering (SE), the need for efficient and accurate data analysis techniques has become crucial. Classification algorithms play a vital role in various SE tasks, such as bug detection, software quality prediction, and requirements classification. Quantum computing offers a new paradigm with the potential to overcome classical computational limitations for certain types of problems. This research proposes the design and implementation of a kernel-based quantum classification algorithm (also known as Quantum Support Vector Machine - QSVM) tailored for data analysis in the SE domain. We will discuss the fundamental principles behind quantum feature mapping and quantum kernel matrices, and demonstrate its implementation using quantum computing libraries. As a case study, the designed algorithm will be tested on a software bug detection dataset, comparing its performance with classical kernel-based classification algorithms like Support Vector Machine (SVM). The result of the comparison show that QSVM is superior in terms of accuracy, precision, recall, and F1-score compared to SVM.
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 support vector machines (QSVMs) are a novel approach for solving classification problems, combining the principles of quantum computing with the support vector machine algorithm. In this study, we applied a QSVM to the Breast Cancer Wisconsin (Original) data set to classify tumors as benign or malignant. Our results showed that the QSVM outperformed classical support vector machines in terms of classification accuracy, achieving a success rate of 100% while classical SVM shows almost perfect result with its accuracy 95%. Additionally, the QSVM required significantly less training time compared to the classical SVM. These results demonstrate the potential of QSVMs for solving complex classification problems in the field of medical diagnosis.
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.