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, Communication and Networking Technologies (ICCCNT)

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

Hasmitha Krishna N, S. Sridevi, R Prasanna Kumar

Published Jul 6, 2023• 14 citations
Publisher

Abstract

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%.

DOI
10.1109/icccnt56998.2023.10307618

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

Quantum Kernel based Support Vector Machine with Quantum Approximate Optimization Algorithm Embedding for improved Lung Cancer Prediction

Shivanya Shomir Dutta, Sahil Sandeep, Sriadibhatla Sridevi +2 more

The integration of classical machine learning with quantum computing has sparked a remarkable revolution, opening avenues to tackle previously insurmountable challenges in diverse fields, particularly in clinical applications. One such challenging task is to predict lung cancer with minimal clinical samples and features. The prominent objective of this proposed research is to introduce a novel Quantum Kernel Support Vector Machine (QKSVM) constructed with the Quantum Kernel Circuit (QKC) enriched with Quantum Approximation Optimization Algorithm (QAOA) embedding circuit to classify highly complex lung cancer using a minimal number of samples and minimal feature dimensions. In this context, to compare the classification performance of the transformative potential of the proposed QAOA embedding QKSVM classifier model, we implemented two other variants of the QKC leveraging Angle embedding (Angle Embedding QKSVM) and Instantaneous Quantum Polynomial embedding (IQP Embedding QKSVM). We also compared their performance with that of a classical SVM classifier. In this study, we delve into the transformative potential classification performance of the proposed QAOA Embedding-based QKSVM classifier, which is contrasted particularly in scenarios with limited sample size and feature dimensions. Our investigation reveals the quantum kernel’s superiority, even when operating with smaller datasets. This remarkable performance is attributed to the quantum models’ robustness in extracting intricate diagnosing features, enabling it to extract more pertinent insights from fewer data points. Notably, the QKSVM model trained with a significantly selected feature vector of 4-Dimensions (4D) with Principal Component Analysis (PCA) emerges as the frontrunner in lung cancer predictions, achieving an outstanding test accuracy of 94.64% and the highest area under curve (AUC) metric of 82.33%.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jun 24, 2024•9 citations

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 +1 more

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.

International Conference on Computing Methodologies and Communication (ICCMC)•Jul 1, 2026•0 citations

Quantum Enhanced Support Vector Machine with Instantaneous Quantum Polynomial Encoding for Improved Cyclone Classification

Sriadibhatla Sridevi, B Indira, Shivanya Shomir Dutta +2 more

The paradigm of classical machine learning has been greatly revolutionized by the integration of the quantum computing paradigm, which has made it possible to solve complicated issues that were previously unsolvable by conventional computers. One such problem is accurately classifying cyclones with minimal data samples and feature parameters. In this paper, we investigate the superior learning capabilities of the Instantaneous Quantum Polynomial Embedding-based kernel Support Vector Machine classifier when compared to the classical Support Vector Machine (SVM) classifier, especially in scenarios with less sample size and feature vector size. Surprisingly, our outcomes reveal that the quantum kernel strategy outperforms its traditional counterpart, even with a smaller sample-based dataset. This incredible performance can be attributed to the quantum core strategy’s exceptional ability to extract complex attributes, which enables it to extract more relevant insights from a smaller number of data points. We present a Quantum Kernel Support Vector Machine (QKSVM) built as a Quantum Kernel Circuit (QKC) in three configurations with varied qubit counts utilizing distinct embedding techniques: Angle embedding (QKSVM Angle), Instantaneous Quantum Polynomial embedding (QKSVM IQP), and Quantum Approximation Optimization Algorithm (QKSVM QAOA) embedding. Our results demonstrate that the QKSVM approach surpasses traditional SVM, especially when IQP embedding is employed. The QSVM model trained with four Principal Component Analysis (PCA) based selected relevant features outperforms the other QKC variations in cyclone classification, obtaining an excellent test accuracy rate of 91.66%.

International Conference on Recent Trends in Advance Computing (ICRTAC)•Dec 14, 2023•9 citations

NQ-SVM: Scalable Quantum Kernel Learning via Nyström-Based Support Vector Machines

Duong The Do, Srikanth Thudumu, Prem Prakash Jayaraman +1 more

Abstract Support vector machines (SVMs) are widely used for classification, but become computationally expensive as datasets grow and data become high-dimensional or nonlinearly separable. Quantum support vector machines (QSVMs) enhance the traditional SVMs by replacing conventional feature mappings with quantum-implemented embeddings that project data into high-dimensional Hilbert spaces, potentially improving expressive power and efficiency. However, training QSVMs on current noisy intermediate-scale quantum (NISQ) devices remains challenging, as constructing the quantum kernel matrix requires repeated circuit executions and scales quadratically with dataset size. We propose NQ-SVM , a hybrid quantum-classical method that incorporates the Nystr\"om approximation to enhance the scalability of QSVMs. By selecting a small set of landmark points, the Nystr\"om method yields a low-rank kernel approximation, reducing complexity from \((O(n^2))\) to \((O(nm))\), while preserving the quantum advantages in handling high-dimensional, non-linear data. Extensive simulations demonstrate that NQ-SVM achieves comparable classification accuracy to classical SVMs and full QSVMs, while substantially reducing training time and kernel evaluation costs. These results underscore the potential of NQ-SVM as a scalable and practical hybrid framework for near-term quantum machine learning (QML).

•Mar 3, 2026•0 citations

Quantum Kernel-Based Support Vector Machine for Deepfake Audio Detection

Shivangi Thakur, Mrityunjay Singh, Shatrughan Modi

In this paper, we introduce a quantum kernel-based method to classify deepfake audio using manually extracted acoustic features. Each audio sample is represented by a 194-dimension feature vector. Features are scaled using training-set statistics and compressed to 8 principal components through PCA, then normalized into the range $[-\pi, \pi]$ in order to perform the angle encoding on quantum circuits. Then, we present a quantum feature map with 8-qubits based on IQP-inspired architecture including Hadamard gates, $R Z\left(x_{i}\right)$ rotation and neighboring Ising-ZZ interaction. The quantum kernel is evaluated by the probability of all-zero state when $U \phi\left(x_{i}\right)$ is applied, followed by $U \phi^{\dagger}\left(x_{j}\right)$. We employ the quantum kernel matrix in the SVM classifier to perform real and fake audio detection. For comparison, a classic RBF-SVM and a Hybrid Variational Quantum Classifier trained with the same preprocessed feature representation are evaluated. The experiments were performed on the FoR-2Sec dataset show that QKSVM achieves an accuracy of 0.9894 in accuracy, F1-score of 0.9894, ROC-AUC of 0.9992, EER of 0.0101, and MCC of 0.9788. The McNemar’s test performed on QKSVM and classic RBF-SVM gives $b=41, c=14, \chi^{2}=12.2909, p=0.000455$. This means that the two classifiers have a statistically significant difference at 0.05 level. The results suggest that quantum kernel-based similarity learning can provide a competitive classification approach for deepfake audio detection using compact acoustic representations.

International Conference on Innovative Sustainable Computational Technologies (CISCT)•Jul 1, 2026•0 citations
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 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.
The integration of classical machine learning with quantum computing has sparked a remarkable revolution, opening avenues to tackle previously insurmountable challenges in diverse fields, particularly in clinical applications. One such challenging task is to predict lung cancer with minimal clinical samples and features. The prominent objective of this proposed research is to introduce a novel Quantum Kernel Support Vector Machine (QKSVM) constructed with the Quantum Kernel Circuit (QKC) enriched with Quantum Approximation Optimization Algorithm (QAOA) embedding circuit to classify highly complex lung cancer using a minimal number of samples and minimal feature dimensions. In this context, to compare the classification performance of the transformative potential of the proposed QAOA embedding QKSVM classifier model, we implemented two other variants of the QKC leveraging Angle embedding (Angle Embedding QKSVM) and Instantaneous Quantum Polynomial embedding (IQP Embedding QKSVM). We also compared their performance with that of a classical SVM classifier. In this study, we delve into the transformative potential classification performance of the proposed QAOA Embedding-based QKSVM classifier, which is contrasted particularly in scenarios with limited sample size and feature dimensions. Our investigation reveals the quantum kernel’s superiority, even when operating with smaller datasets. This remarkable performance is attributed to the quantum models’ robustness in extracting intricate diagnosing features, enabling it to extract more pertinent insights from fewer data points. Notably, the QKSVM model trained with a significantly selected feature vector of 4-Dimensions (4D) with Principal Component Analysis (PCA) emerges as the frontrunner in lung cancer predictions, achieving an outstanding test accuracy of 94.64% and the highest area under curve (AUC) metric of 82.33%.
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.
The paradigm of classical machine learning has been greatly revolutionized by the integration of the quantum computing paradigm, which has made it possible to solve complicated issues that were previously unsolvable by conventional computers. One such problem is accurately classifying cyclones with minimal data samples and feature parameters. In this paper, we investigate the superior learning capabilities of the Instantaneous Quantum Polynomial Embedding-based kernel Support Vector Machine classifier when compared to the classical Support Vector Machine (SVM) classifier, especially in scenarios with less sample size and feature vector size. Surprisingly, our outcomes reveal that the quantum kernel strategy outperforms its traditional counterpart, even with a smaller sample-based dataset. This incredible performance can be attributed to the quantum core strategy’s exceptional ability to extract complex attributes, which enables it to extract more relevant insights from a smaller number of data points. We present a Quantum Kernel Support Vector Machine (QKSVM) built as a Quantum Kernel Circuit (QKC) in three configurations with varied qubit counts utilizing distinct embedding techniques: Angle embedding (QKSVM Angle), Instantaneous Quantum Polynomial embedding (QKSVM IQP), and Quantum Approximation Optimization Algorithm (QKSVM QAOA) embedding. Our results demonstrate that the QKSVM approach surpasses traditional SVM, especially when IQP embedding is employed. The QSVM model trained with four Principal Component Analysis (PCA) based selected relevant features outperforms the other QKC variations in cyclone classification, obtaining an excellent test accuracy rate of 91.66%.
Abstract Support vector machines (SVMs) are widely used for classification, but become computationally expensive as datasets grow and data become high-dimensional or nonlinearly separable. Quantum support vector machines (QSVMs) enhance the traditional SVMs by replacing conventional feature mappings with quantum-implemented embeddings that project data into high-dimensional Hilbert spaces, potentially improving expressive power and efficiency. However, training QSVMs on current noisy intermediate-scale quantum (NISQ) devices remains challenging, as constructing the quantum kernel matrix requires repeated circuit executions and scales quadratically with dataset size. We propose NQ-SVM , a hybrid quantum-classical method that incorporates the Nystr\"om approximation to enhance the scalability of QSVMs. By selecting a small set of landmark points, the Nystr\"om method yields a low-rank kernel approximation, reducing complexity from (O(n2))(O(n^2))(O(n2)) to (O(nm))(O(nm))(O(nm)), while preserving the quantum advantages in handling high-dimensional, non-linear data. Extensive simulations demonstrate that NQ-SVM achieves comparable classification accuracy to classical SVMs and full QSVMs, while substantially reducing training time and kernel evaluation costs. These results underscore the potential of NQ-SVM as a scalable and practical hybrid framework for near-term quantum machine learning (QML).
In this paper, we introduce a quantum kernel-based method to classify deepfake audio using manually extracted acoustic features. Each audio sample is represented by a 194-dimension feature vector. Features are scaled using training-set statistics and compressed to 8 principal components through PCA, then normalized into the range [−π,π][-\pi, \pi][−π,π] in order to perform the angle encoding on quantum circuits. Then, we present a quantum feature map with 8-qubits based on IQP-inspired architecture including Hadamard gates, RZ(xi)R Z\left(x_{i}\right)RZ(xi​) rotation and neighboring Ising-ZZ interaction. The quantum kernel is evaluated by the probability of all-zero state when Uϕ(xi)U \phi\left(x_{i}\right)Uϕ(xi​) is applied, followed by Uϕ†(xj)U \phi^{\dagger}\left(x_{j}\right)Uϕ†(xj​). We employ the quantum kernel matrix in the SVM classifier to perform real and fake audio detection. For comparison, a classic RBF-SVM and a Hybrid Variational Quantum Classifier trained with the same preprocessed feature representation are evaluated. The experiments were performed on the FoR-2Sec dataset show that QKSVM achieves an accuracy of 0.9894 in accuracy, F1-score of 0.9894, ROC-AUC of 0.9992, EER of 0.0101, and MCC of 0.9788. The McNemar’s test performed on QKSVM and classic RBF-SVM gives b=41,c=14,χ2=12.2909,p=0.000455b=41, c=14, \chi^{2}=12.2909, p=0.000455b=41,c=14,χ2=12.2909,p=0.000455. This means that the two classifiers have a statistically significant difference at 0.05 level. The results suggest that quantum kernel-based similarity learning can provide a competitive classification approach for deepfake audio detection using compact acoustic representations.