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

Quantum Time Series Similarity Measures and Quantum Temporal Kernels

Vanio Markov, Vladimir Rastunkov, Daniel Fry

Published Dec 4, 2023• 2 citations
arXivHTMLPDF

Abstract

This article presents a quantum computing approach to designing of similarity measures and kernels for classification of stochastic symbolic time series. In the area of machine learning, kernels are important components of various similarity-based classification, clustering, and regression algorithms. An effective strategy for devising problem-specific kernels is leveraging existing generative models of the example space. In this study we assume that a quantum generative model, known as quantum hidden Markov model (QHMM), describes the underlying distributions of the examples. The sequence structure and probability are determined by transitions within model's density operator space. Consequently, the QHMM defines a mapping from the example space into the broader quantum space of density operators. Sequence similarity is evaluated using divergence measures such as trace and Bures distances between quantum states. We conducted extensive simulations to explore the relationship between the distribution of kernel-estimated similarity and the dimensionality of the QHMMs Hilbert space. As anticipated, a higher dimension of the Hilbert space corresponds to greater sequence distances and a more distinct separation of the examples. To empirically evaluate the performance of the kernels, we defined classification tasks based on a simplified generative model of directional price movement in the stock market. We implemented two widely-used kernel-based algorithms - support vector machines and k-nearest neighbors - using both classical and quantum kernels. Across all classification task scenarios, the quantum kernels consistently demonstrated superior performance compared to their classical counterparts.

DOI
10.48550/arxiv.2312.01602

Related papers

Investigating Quantum Kernel Feature Maps and Kernel Alignment for Multivariate Spatio-Temporal Pattern Classification

Vishwambhar Pathak, Nisheeth Joshi, Prabhat Mahanti

AI-driven solutions and simulations often involve spatio-temporal multivariate signals. However, such real-life signals are mostly nonlinear, noisy, and high-dimensional. Fetching sparse and subtle spatio-temporal patterns from them for descriptive and predictive applications poses challenge to traditional machine learning models. With recent practicable advancements in quantum computing technologies, quantum kernel methods have been exploited to map classical data into high-dimensional Hilbert spaces which transform complex relationships into separable patterns. In this work we investigate the effectiveness of quantum kernel methods for the case of EEG signal classification and compares their performance with classical radial basis function (RBF) kernels. Quantum encoding was performed using angle-encoding and necessary circuit elements including swap-test. The investigation was conducted using two sets of synthetic EEG datasets: (1) simple sinusoidal signals and (2) nonlinear signals with phase and amplitude variability. Principal Component Analysis was used to reduce dimensionality before kernel construction. For contrasting the Classical vs Quantum workflows, feature maps produced by Classical and Quantum kernel matrices were computed and fed to Support Vector Machine (SVM) classifier. The workflow then evaluated Kernel-target alignment for estimation of the correspondence between kernel similarity structures and class labels. For simple sinusoidal signals, training with the classical kernels achieved accuracies up to 0.967 for 8 principal component features as compared to 0.86 accuracy with the quantum kernels. However, for nonlinear EEG signals, while both workflows gave lower accuracies, still quantum kernels yielded slightly better accuracy 0.46 as compared to 0.40 by the classical kernels. The kernel-target alignment was mostly better with classical kernel, with slightly better for quantum kernel in one case. The slight improvement with quantum kernel in non-linear signal case suggests that quantum kernels may provide advantages in modelling complex nonlinear relationships. Limited alignment and limited accuracy improvement with the quantum kernel indicate need for further improvement in quantum-feature-map design to achieve quantum advantage.

•May 1, 2026•0 citations

Quantum-Inspired Kernel Design for Support Vector Machines

Jincheng Zhang

Support Vector Machines (SVMs) are powerful machine learning models widely used for classification and regression tasks. However, their performance can be significantly impacted by the choice of the kernel function, which defines how data points are mapped into a higher-dimensional space. Traditional kernels often struggle to capture complex, non-linear relationships effectively, leading to suboptimal results. This paper proposes a novel approach to kernel design inspired by quantum mechanical principles. Specifically, we leverage concepts of quantum entanglement and superposition to generate kernels that can potentially capture richer and more nuanced data patterns. Our core claim is that employing these quantum-inspired designs can improve SVM performance and scalability. We present a theoretical framework outlining how quantum mechanical effects can be translated into kernel functions. The proposed method is based on constructing kernel functions that implicitly encode correlations between data points, mimicking the inherent interconnectedness observed in quantum systems. We explore specific kernel formulations based on these principles and discuss their potential advantages and challenges. The ultimate goal is to demonstrate that quantum inspiration can unlock new avenues for kernel design, leading to more effective SVM models.

•Sep 5, 2026•0 citations

Harnessing Quantum Kernels for Supervised Learning: A Deep Dive into Quantum SVMs

Rajeev Tripathi, Ravi Shanker Pandey

The quantum support vector machines (QSVMs) offer a paradigm change that may leverage quantum mechanical processes to outperform traditional support vector machines (SVMs) in high-dimensional and nonlinear classification tasks. These machines are located at the crossroads of supervised machine learning and quantum computing. The purpose of this chapter is to provide a comprehensive technical analysis of QSVMs, with a particular emphasis on the use of variation quantum circuits for implicit feature space transformations and the development of these circuits within the context of quantum kernel estimation. Through the use of quantum state preparation and interference, we provide a comprehensive explanation of the possible fabrication of quantum kernels that are based on inner product evaluations in exponentially huge Hilbert spaces. When it comes to boosting model expressivity beyond classical limits, the importance that entanglement and quantum feature mapping play is specifically stressed. In addition to this, we investigate algorithmic implementations on noisy intermediate-scale quantum (NISQ) hardware, focusing on problems associated with quantum decoherence, gate fidelity, and loop depth optimization. Several fields, including quantum-enhanced drug discovery, anomaly detection in quantum sensor networks, fault classification in quantum error correction, and portfolio optimization, are now the focus of research that is being conducted in order to develop real-world applications. This chapter comes to a close with an analysis of the existing theoretical limits, resource needs, and future perspectives for the use of QSVMs in machine learning applications in order to achieve a quantum advantage. In order to facilitate the development of scalable quantum machine learning models that are founded on strong mathematical and computational notions, this synthesis is geared at academics and practitioners.

CRC Press eBooks•Jul 13, 2026•0 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

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

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.

arXiv:2407.09930•Jul 13, 2024•25 citations

Quantum Feature Spaces and Kernels

Hamid D. Ismail

This chapter develops the theory and practice of quantum feature maps and quantum kernels as a central framework in quantum machine learning (QML). Building on the data-encoding methods introduced in the previous chapter, it explains how classical inputs are embedded into quantum states and how similarity between data points is then defined through overlaps in Hilbert space. This chapter introduces the quantum kernel as the squared overlap between encoded states, establishes its fundamental algebraic properties, and shows how it satisfies the conditions required for direct use in classical kernel-learning methods such as support vector machines, kernel ridge regression, and Gaussian process models. A major focus is placed on the circuit-level realization and estimation of quantum kernels. This chapter presents kernel evaluation through encoding unitaries and examines three principal estimation methods: the SWAP test, the Hadamard test, and the direct return-probability method, with attention to their trade-offs in qubit overhead, circuit depth, and suitability for NISQ hardware. It also develops the geometric interpretation of quantum kernels in Hilbert space, relating kernel values to angular separation, decision boundaries, expressivity, and generalization. Together, these ideas provide a unified foundation for understanding how quantum circuits, feature maps, and classical learning algorithms interact in hybrid quantum-classical kernel models.

CRC Press eBooks•Nov 4, 2026•0 citations
This article presents a quantum computing approach to designing of similarity measures and kernels for classification of stochastic symbolic time series. In the area of machine learning, kernels are important components of various similarity-based classification, clustering, and regression algorithms. An effective strategy for devising problem-specific kernels is leveraging existing generative models of the example space. In this study we assume that a quantum generative model, known as quantum hidden Markov model (QHMM), describes the underlying distributions of the examples. The sequence structure and probability are determined by transitions within model's density operator space. Consequently, the QHMM defines a mapping from the example space into the broader quantum space of density operators. Sequence similarity is evaluated using divergence measures such as trace and Bures distances between quantum states. We conducted extensive simulations to explore the relationship between the distribution of kernel-estimated similarity and the dimensionality of the QHMMs Hilbert space. As anticipated, a higher dimension of the Hilbert space corresponds to greater sequence distances and a more distinct separation of the examples. To empirically evaluate the performance of the kernels, we defined classification tasks based on a simplified generative model of directional price movement in the stock market. We implemented two widely-used kernel-based algorithms - support vector machines and k-nearest neighbors - using both classical and quantum kernels. Across all classification task scenarios, the quantum kernels consistently demonstrated superior performance compared to their classical counterparts.
AI-driven solutions and simulations often involve spatio-temporal multivariate signals. However, such real-life signals are mostly nonlinear, noisy, and high-dimensional. Fetching sparse and subtle spatio-temporal patterns from them for descriptive and predictive applications poses challenge to traditional machine learning models. With recent practicable advancements in quantum computing technologies, quantum kernel methods have been exploited to map classical data into high-dimensional Hilbert spaces which transform complex relationships into separable patterns. In this work we investigate the effectiveness of quantum kernel methods for the case of EEG signal classification and compares their performance with classical radial basis function (RBF) kernels. Quantum encoding was performed using angle-encoding and necessary circuit elements including swap-test. The investigation was conducted using two sets of synthetic EEG datasets: (1) simple sinusoidal signals and (2) nonlinear signals with phase and amplitude variability. Principal Component Analysis was used to reduce dimensionality before kernel construction. For contrasting the Classical vs Quantum workflows, feature maps produced by Classical and Quantum kernel matrices were computed and fed to Support Vector Machine (SVM) classifier. The workflow then evaluated Kernel-target alignment for estimation of the correspondence between kernel similarity structures and class labels. For simple sinusoidal signals, training with the classical kernels achieved accuracies up to 0.967 for 8 principal component features as compared to 0.86 accuracy with the quantum kernels. However, for nonlinear EEG signals, while both workflows gave lower accuracies, still quantum kernels yielded slightly better accuracy 0.46 as compared to 0.40 by the classical kernels. The kernel-target alignment was mostly better with classical kernel, with slightly better for quantum kernel in one case. The slight improvement with quantum kernel in non-linear signal case suggests that quantum kernels may provide advantages in modelling complex nonlinear relationships. Limited alignment and limited accuracy improvement with the quantum kernel indicate need for further improvement in quantum-feature-map design to achieve quantum advantage.
Support Vector Machines (SVMs) are powerful machine learning models widely used for classification and regression tasks. However, their performance can be significantly impacted by the choice of the kernel function, which defines how data points are mapped into a higher-dimensional space. Traditional kernels often struggle to capture complex, non-linear relationships effectively, leading to suboptimal results. This paper proposes a novel approach to kernel design inspired by quantum mechanical principles. Specifically, we leverage concepts of quantum entanglement and superposition to generate kernels that can potentially capture richer and more nuanced data patterns. Our core claim is that employing these quantum-inspired designs can improve SVM performance and scalability. We present a theoretical framework outlining how quantum mechanical effects can be translated into kernel functions. The proposed method is based on constructing kernel functions that implicitly encode correlations between data points, mimicking the inherent interconnectedness observed in quantum systems. We explore specific kernel formulations based on these principles and discuss their potential advantages and challenges. The ultimate goal is to demonstrate that quantum inspiration can unlock new avenues for kernel design, leading to more effective SVM models.
The quantum support vector machines (QSVMs) offer a paradigm change that may leverage quantum mechanical processes to outperform traditional support vector machines (SVMs) in high-dimensional and nonlinear classification tasks. These machines are located at the crossroads of supervised machine learning and quantum computing. The purpose of this chapter is to provide a comprehensive technical analysis of QSVMs, with a particular emphasis on the use of variation quantum circuits for implicit feature space transformations and the development of these circuits within the context of quantum kernel estimation. Through the use of quantum state preparation and interference, we provide a comprehensive explanation of the possible fabrication of quantum kernels that are based on inner product evaluations in exponentially huge Hilbert spaces. When it comes to boosting model expressivity beyond classical limits, the importance that entanglement and quantum feature mapping play is specifically stressed. In addition to this, we investigate algorithmic implementations on noisy intermediate-scale quantum (NISQ) hardware, focusing on problems associated with quantum decoherence, gate fidelity, and loop depth optimization. Several fields, including quantum-enhanced drug discovery, anomaly detection in quantum sensor networks, fault classification in quantum error correction, and portfolio optimization, are now the focus of research that is being conducted in order to develop real-world applications. This chapter comes to a close with an analysis of the existing theoretical limits, resource needs, and future perspectives for the use of QSVMs in machine learning applications in order to achieve a quantum advantage. In order to facilitate the development of scalable quantum machine learning models that are founded on strong mathematical and computational notions, this synthesis is geared at academics and practitioners.
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 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.
This chapter develops the theory and practice of quantum feature maps and quantum kernels as a central framework in quantum machine learning (QML). Building on the data-encoding methods introduced in the previous chapter, it explains how classical inputs are embedded into quantum states and how similarity between data points is then defined through overlaps in Hilbert space. This chapter introduces the quantum kernel as the squared overlap between encoded states, establishes its fundamental algebraic properties, and shows how it satisfies the conditions required for direct use in classical kernel-learning methods such as support vector machines, kernel ridge regression, and Gaussian process models. A major focus is placed on the circuit-level realization and estimation of quantum kernels. This chapter presents kernel evaluation through encoding unitaries and examines three principal estimation methods: the SWAP test, the Hadamard test, and the direct return-probability method, with attention to their trade-offs in qubit overhead, circuit depth, and suitability for NISQ hardware. It also develops the geometric interpretation of quantum kernels in Hilbert space, relating kernel values to angular separation, decision boundaries, expressivity, and generalization. Together, these ideas provide a unified foundation for understanding how quantum circuits, feature maps, and classical learning algorithms interact in hybrid quantum-classical kernel models.