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 Computing Methodologies and Communication (ICCMC)

Design and Evaluation of a Quantum Kernel Support Vector Classifier using Qiskit for Hybrid Quantum–Classical Binary Classification

H.Shree Kumar, Eslavath Hemanth Naik, Gadige Hemanth, B Mahesh Karthik

Published Jul 1, 2026• 0 citations
Publisher

Abstract

Over The past decade, quantum computing and machine learning have each witnessed tremendous growth in their respective fields. While quantum computing promises a completely novel paradigm for computation, based on the principles of superposition, entanglement, and interference, machine learning has firmly cemented its place in the sphere of data-driven decision-making. This paper seeks to provide a practical solution to this question, implementing a quantum classical learning system that is capable of performing binary classification tasks. We achieve this through the creation of a Quantum Kernel Support Vector Classifier (QSVC) using the Qiskit framework. While the classical feature set from the Iris dataset is scaled appropriately for the quantum system, the feature set is then represented in the quantum state through the ZZFeatureMap circuit. The QSVC utilizes the kernel-based similarity between quantum states. The results were promising, with the QSVC obtaining a classification accuracy of 92% over a test set, with the model trained in 6.32 seconds on a simulated quantum backend. The decision boundaries learned by the model were complex, and the quantum kernel representation of the feature set was able to capture the underlying class structure, which would have been difficult to achieve in a classical low-dimensional feature space. Our method, with quantum circuits relegated to state preparation and measurement while leaving the optimization to classical processes, is designed to operate within these limits. This makes our method not only theoretically interesting but also immediately applicable to existing simulators and quantum hardware.

DOI
10.1109/iccmc69250.2026.11624761

Related papers

Quantum Kernel-Based Classification: An Optimized Quantum Support Vector Classifier Approach

Xiaoman Liu

Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.

IEEE International Conference on Frontiers Technology of Information and Computer (ICFTIC)•Dec 13, 2024•0 citations

From Theory to Practice: Quantum Kernels in Support Vector Classification for Improved Performance

Nhat-Trinh Le, Nhat Tan Thai, Cao Vu Bui

Quantum computing offers a powerful new paradigm for enhancing classical machine learning, particularly in classification tasks. In this paper, we examine the use of quantum kernels within Support Vector Classification (SVC) and compare their performance to classical SVC. Our experiments focus on the Iris and Wine datasets. For the Wine dataset, we applied Principal Component Analysis (PCA), reducing the feature space from 13 to 4 dimensions to improve computational efficiency. The results demonstrate that Quantum-enhanced SVC (QSVC) outperforms classical SVC, achieving an accuracy improvement from 96.15% with classical SVM to 98.05% with QSVC for the Wine dataset. Similarly, for the Iris dataset, classical SVC achieves near-perfect accuracy at 100%, while QSVC closely follows with 97.25% accuracy. These results highlight the capability of quantum kernels to improve both accuracy and efficiency in classification tasks, providing a promising direction for scalable quantum-classical hybrid systems in machine learning.

RIVF International Conference on Computing and Communication Technologies (RIVF)•Dec 21, 2024•2 citations

Quantum Kernel-aided Support Vector Machine Classifier for Improved Speech Classification

Hasmitha Krishna N, S. Sridevi, R Prasanna Kumar

The field of machine learning has been revolutionized by quantum computing, as it has the capacity to tackle complex problems that are beyond the capabilities of classical computers. One such problem is the efficient classification of speech signals with limited data, employing extracted feature attributes like Mel-scale frequency cepstral coefficients (MFCCs). This study compares the performance of classical machine learning models with a Quantum Support Vector Machine (QKSVM) classifier on a data set with a limited number of audio samples. Interestingly, the quantum kernel method outperformed classical models despite the small sample size. This result can be attributed to the quantum kernel method’s ability to extract high-dimensional features efficiently, allowing it to learn more from fewer samples. The Quantum Kernel Circuit (QKC) is contrived in different variants comprising 13, 8, 7, and 4 qubits. This QKC is built with an Angle Embedding layer, an adjoint version of the Angle Embedding layer, and a Hermitian space observable layer. Our findings demonstrate that the hybrid quantum kernel-based technique outperforms existing classical solutions. Amongst variants, the Quantum support vector machine model with 13 optimal numbers of coefficients is efficient in speech classification with the highest accuracy of 87.32%.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jul 6, 2023•14 citations

Quantum-Enhanced Classification and Clustering Through Hybrid Quantum–Classical Learning on Synthetic Data

Suraj Kamal Kanal

Quantum Machine Learning (QML) has emerged as a promising paradigm that combines principles of quantum computation with classical learning techniques to address challenges posed by complex, high-dimensional, and non-linear datasets. This work presents a systematic experimental study of quantum-enhanced classification and clustering using hybrid quantum–classical models evaluated on synthetically generated datasets. Quantum Support Vector Machines (QSVM) and Variational Quantum Classifiers (VQC) are implemented using the Qiskit framework and benchmarked against established classical algorithms. The synthetic datasets are carefully designed to control linearity, dimensionality, class overlap, and nonlinear structure, enabling a detailed performance comparison under both ideal and noisy simulation conditions. The experimental results indicate that quantum feature representations can enhance class separability in non-linear scenarios, while also highlighting the practical limitations imposed by noise sensitivity and circuit depth constraints inherent to Noisy Intermediate-Scale Quantum (NISQ) devices .

International Journal for Research in Applied Science and Engineering Technology•Jan 11, 2026•0 citations

A Triple-Hybrid Quantum Support Vector Machine Using Classical, Quantum Gate-based and Quantum Annealing-based Computing

Juan C. Boschero, Ward van der Schoot, Niels M. P. Neumann

Quantum machine learning is one of the fields where quantum computers are expected to bring advantages over classical methods. However, the limited size of current computers restricts the exploitation of the full potential of quantum machine learning methods. Additionally, different computing paradigms, both quantum and classical, each have their own strengths and weaknesses. Obtaining optimal results with algorithms thus requires algorithms to be tweaked to the underlying computational paradigm, and the tasks to be optimally distributed over the available computational resources. In this work, we explore the potential gains from combining different computing paradigms to solve the complex task of data classification for three different datasets. We use a gate-based quantum model to implement a quantum kernel and implement a complex feature map. Next, we formulate a quadratic unconstrained optimisation problem to be solved on quantum annealing hardware. We then evaluate the losses on classical hardware and reconfigure the model parameters accordingly. We tested this so-called triple-hybrid quantum support vector machine on various data sets, and find that it achieves higher precision than other support vector machines (both quantum and classical) on complex quantum data, whereas it achieves varying performance on simple classical data using limited training. For the complex data sets, the triple-hybrid version converges faster, requiring fewer circuit evaluations.

quant-pharXiv:2511.05237•Nov 10, 2025•1 citation

Quantum Computing in Machine Learning: Performance Evaluation and Comparative Analysis

Simões, Jaime Marques

This thesis explores the integration of quantum computing into Machine Learning (ML), aiming to evaluate the effectiveness and limitations of quantum-enhanced models compared to classical approaches. As quantum technologies continue to develop, they offer the potential for solving complex computational problems more efficiently, particularly in fields requiring high-dimensional data processing. A literature review is conducted to contextualize current advancements in Quantum Machine Learning, highlighting theoretical benefits and existing practical limitations. This work investigates whether quantum methods, specifically the Quantum Support Vector Classifier (QSVC), can provide measurable improvements over its classical counterpart. The QSVC, implemented using IBM’s Qiskit ML library, replaces traditional kernel functions with quantum kernels computed via quantum circuits and feature maps, embedding classical data into a Hilbert space. The experimental portion of this thesis compares classical and quantum models on two distinct datasets: one from the healthcare domain and another from particle physics. Various parameters are tested in a constrained grid search due to the high computational demands of quantum circuits. Results indicate that while quantum models are significantly more resource-intensive, they can achieve comparable or even improved performance on data that has more complex relations between their variables. However, scalability remains a major challenge. This work concludes that although QSVC does not yet consistently outperform classical models, it offers advantages in specific contexts and lays the groundwork for identifying future use cases where quantum computing may offer a practical advantage in ML.

•Nov 6, 2025•0 citations
Over The past decade, quantum computing and machine learning have each witnessed tremendous growth in their respective fields. While quantum computing promises a completely novel paradigm for computation, based on the principles of superposition, entanglement, and interference, machine learning has firmly cemented its place in the sphere of data-driven decision-making. This paper seeks to provide a practical solution to this question, implementing a quantum classical learning system that is capable of performing binary classification tasks. We achieve this through the creation of a Quantum Kernel Support Vector Classifier (QSVC) using the Qiskit framework. While the classical feature set from the Iris dataset is scaled appropriately for the quantum system, the feature set is then represented in the quantum state through the ZZFeatureMap circuit. The QSVC utilizes the kernel-based similarity between quantum states. The results were promising, with the QSVC obtaining a classification accuracy of 92% over a test set, with the model trained in 6.32 seconds on a simulated quantum backend. The decision boundaries learned by the model were complex, and the quantum kernel representation of the feature set was able to capture the underlying class structure, which would have been difficult to achieve in a classical low-dimensional feature space. Our method, with quantum circuits relegated to state preparation and measurement while leaving the optimization to classical processes, is designed to operate within these limits. This makes our method not only theoretically interesting but also immediately applicable to existing simulators and quantum hardware.
Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.
Quantum computing offers a powerful new paradigm for enhancing classical machine learning, particularly in classification tasks. In this paper, we examine the use of quantum kernels within Support Vector Classification (SVC) and compare their performance to classical SVC. Our experiments focus on the Iris and Wine datasets. For the Wine dataset, we applied Principal Component Analysis (PCA), reducing the feature space from 13 to 4 dimensions to improve computational efficiency. The results demonstrate that Quantum-enhanced SVC (QSVC) outperforms classical SVC, achieving an accuracy improvement from 96.15% with classical SVM to 98.05% with QSVC for the Wine dataset. Similarly, for the Iris dataset, classical SVC achieves near-perfect accuracy at 100%, while QSVC closely follows with 97.25% accuracy. These results highlight the capability of quantum kernels to improve both accuracy and efficiency in classification tasks, providing a promising direction for scalable quantum-classical hybrid systems in machine learning.
The field of machine learning has been revolutionized by quantum computing, as it has the capacity to tackle complex problems that are beyond the capabilities of classical computers. One such problem is the efficient classification of speech signals with limited data, employing extracted feature attributes like Mel-scale frequency cepstral coefficients (MFCCs). This study compares the performance of classical machine learning models with a Quantum Support Vector Machine (QKSVM) classifier on a data set with a limited number of audio samples. Interestingly, the quantum kernel method outperformed classical models despite the small sample size. This result can be attributed to the quantum kernel method’s ability to extract high-dimensional features efficiently, allowing it to learn more from fewer samples. The Quantum Kernel Circuit (QKC) is contrived in different variants comprising 13, 8, 7, and 4 qubits. This QKC is built with an Angle Embedding layer, an adjoint version of the Angle Embedding layer, and a Hermitian space observable layer. Our findings demonstrate that the hybrid quantum kernel-based technique outperforms existing classical solutions. Amongst variants, the Quantum support vector machine model with 13 optimal numbers of coefficients is efficient in speech classification with the highest accuracy of 87.32%.
Quantum Machine Learning (QML) has emerged as a promising paradigm that combines principles of quantum computation with classical learning techniques to address challenges posed by complex, high-dimensional, and non-linear datasets. This work presents a systematic experimental study of quantum-enhanced classification and clustering using hybrid quantum–classical models evaluated on synthetically generated datasets. Quantum Support Vector Machines (QSVM) and Variational Quantum Classifiers (VQC) are implemented using the Qiskit framework and benchmarked against established classical algorithms. The synthetic datasets are carefully designed to control linearity, dimensionality, class overlap, and nonlinear structure, enabling a detailed performance comparison under both ideal and noisy simulation conditions. The experimental results indicate that quantum feature representations can enhance class separability in non-linear scenarios, while also highlighting the practical limitations imposed by noise sensitivity and circuit depth constraints inherent to Noisy Intermediate-Scale Quantum (NISQ) devices .
Quantum machine learning is one of the fields where quantum computers are expected to bring advantages over classical methods. However, the limited size of current computers restricts the exploitation of the full potential of quantum machine learning methods. Additionally, different computing paradigms, both quantum and classical, each have their own strengths and weaknesses. Obtaining optimal results with algorithms thus requires algorithms to be tweaked to the underlying computational paradigm, and the tasks to be optimally distributed over the available computational resources. In this work, we explore the potential gains from combining different computing paradigms to solve the complex task of data classification for three different datasets. We use a gate-based quantum model to implement a quantum kernel and implement a complex feature map. Next, we formulate a quadratic unconstrained optimisation problem to be solved on quantum annealing hardware. We then evaluate the losses on classical hardware and reconfigure the model parameters accordingly. We tested this so-called triple-hybrid quantum support vector machine on various data sets, and find that it achieves higher precision than other support vector machines (both quantum and classical) on complex quantum data, whereas it achieves varying performance on simple classical data using limited training. For the complex data sets, the triple-hybrid version converges faster, requiring fewer circuit evaluations.
This thesis explores the integration of quantum computing into Machine Learning (ML), aiming to evaluate the effectiveness and limitations of quantum-enhanced models compared to classical approaches. As quantum technologies continue to develop, they offer the potential for solving complex computational problems more efficiently, particularly in fields requiring high-dimensional data processing. A literature review is conducted to contextualize current advancements in Quantum Machine Learning, highlighting theoretical benefits and existing practical limitations. This work investigates whether quantum methods, specifically the Quantum Support Vector Classifier (QSVC), can provide measurable improvements over its classical counterpart. The QSVC, implemented using IBM’s Qiskit ML library, replaces traditional kernel functions with quantum kernels computed via quantum circuits and feature maps, embedding classical data into a Hilbert space. The experimental portion of this thesis compares classical and quantum models on two distinct datasets: one from the healthcare domain and another from particle physics. Various parameters are tested in a constrained grid search due to the high computational demands of quantum circuits. Results indicate that while quantum models are significantly more resource-intensive, they can achieve comparable or even improved performance on data that has more complex relations between their variables. However, scalability remains a major challenge. This work concludes that although QSVC does not yet consistently outperform classical models, it offers advantages in specific contexts and lays the groundwork for identifying future use cases where quantum computing may offer a practical advantage in ML.