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

Enhancing Quantum Machine Learning: The Power of Non-Linear OpticalReproducing Kernels

Shahram Dehdashti, Prayag Tiwari, Kareem H. El-Safty, Peter Bruza, Janis Nötzel

Published Sep 26, 2024• 5 citations
arXivHTMLPDF

Abstract

Abstract Amidst the array of quantum machine learning algorithms, the quantum kernel method has emerged as a focal point, primarily owing to its compatibility with noisy intermediate-scale quantum devices and its promise to achieve quantum advantage. This method operates by nonlinearly transforming data into feature space constructed with quantum states, enabling classification and regression tasks. In this study, we present a novel feature space constructed using Kerr coherent states, which generalize su(2), su(1,1) coherent states, and squeezed states. Notably, the feature space exhibits constant curvature, comprising both spherical and hyperbolic geometries, depending on the sign of the Kerr parameter. Remarkably, the physical parameters associated with the coherent states, enable control over the curvature of the feature space. Our study employs Kerr kernels derived from encoding data into the phase and amplitude of Kerr coherent states. We analyze various datasets ranging from Moon to breast cancer diagnostics. Our findings demonstrate the robustness of Kerr coherent states, attributed to their flexibility in accommodating different hyperparameters, thereby offering superior performance across noisy datasets and hardware setups.

DOI
10.21203/rs.3.rs-4983681/v1

Related papers

Continuous-variable quantum kernel method on a programmable photonic quantum processor

Keitaro Anai, Shion Ikehara, Yoshichika Yano +2 more

Among various quantum machine learning (QML) algorithms, the quantum kernel method has especially attracted attention due to its compatibility with noisy intermediate-scale quantum devices and its potential to achieve quantum advantage. This method performs classification and regression by nonlinearly mapping data into quantum states in a higher-dimensional Hilbert space. Thus far, the quantum kernel method has been implemented only on qubit-based systems, but continuous-variable (CV) systems can potentially offer superior computational power by utilizing its infinite-dimensional Hilbert space. Here, we demonstrate the implementation of the classification task with the CV quantum kernel method on a programmable photonic quantum processor. We experimentally prove that the CV quantum kernel method successfully classifies several datasets robustly even under the experimental imperfections, with high accuracies comparable to the classical kernel. This demonstration sheds light on the utility of CV quantum systems for QML and should stimulate further study in other CV QML algorithms.

arXiv:2405.01086•Physical Review A•Aug 2, 2024•10 citations

Benchmarking Quantum Machine Learning Kernel Training for Classification Tasks

Diego Álvarez-Estévez

Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.

arXiv:2408.10274•IEEE Transactions on Quantum Engineering•Jan 1, 2025•52 citations

Generalized coherent states, reproducing kernels, and quantum support vector machines

Rupak Chatterjee, Ting Yu

The support vector machine (SVM) is a popular machine learning classification method which produces a nonlinear decision boundary in a feature space by constructing linear boundaries in a transformed Hilbert space. It is well known that these algorithms when executed on a classical computer do not scale well with the size of the feature space both in terms of data points and dimensionality. One of the most significant limitations of classical algorithms using non-linear kernels is that the kernel function has to be evaluated for all pairs of input feature vectors which themselves may be of substantially high dimension. This can lead to computationally excessive times during training and during the prediction process for a new data point. Here, we propose using both canonical and generalized coherent states to calculate specific nonlinear kernel functions. The key link will be the reproducing kernel Hilbert space (RKHS) property for SVMs that naturally arise from canonical and generalized coherent states. Specifically, we discuss the evaluation of radial kernels through a positive operator valued measure (POVM) on a quantum optical system based on canonical coherent states. A similar procedure may also lead to calculations of kernels not usually used in classical algorithms such as those arising from generalized coherent states.

Quantum Information and Computation•Dec 1, 2017•41 citations

Kernel method based on non-linear coherent states in quantum feature space

Prayag Tiwari, Shahram Dehdashti, Abdul Karim Obeid +2 more

Abstract In this paper, by mapping datasets to a set of non-linear coherent states, the process of encoding inputs in quantum states as a non-linear feature map is re-interpreted. As a result of the fact that the radial basis function is recovered when data is mapped to a complex Hilbert state represented by coherent states, non-linear coherent states can be considered as a natural generalisation of the associated kernels. In this paper, as an example of kernels based on non-linear coherent states, we propose kernel functions based on generalized hypergeometric functions, as orthogonal polynomial functions. The suggested kernel is implemented with the support vector machine (SVM) on two well known datasets (make_circles, and make_moons) and outperforms the baselines, even when the level of noise is high. In addition, we study the impact of the geometrical properties of the feature space, obtained by the non-linear coherent states, on the SVM classification task, by considering the Fubini–Study metric of the associated coherent states.

arXiv:2007.07887•Journal of Physics A Mathematical and Theoretical•Jul 15, 2022•29 citations

A Hybrid Quantum Machine Learning Framework Based on Nyström Approximation for Scalability Enhancement of Quantum Kernels

Mohammad Hossein Rezvannia

Abstract Quantum Machine Learning (QML) is an emerging field at the intersection of quantum computing and artificial intelligence, offering high potential for extracting complex nonlinear patterns from high-dimensional data. However, many quantum kernel-based methods suffer from high computational costs, the requirement for numerous quantum circuit executions, and the limitations of current Noisy Intermediate-Scale Quantum (NISQ) hardware. These challenges, particularly when dealing with large datasets, represent a major barrier to the widespread adoption of these methods in practical applications. In this paper, a hybrid quantum machine learning framework based on Nyström approximation is proposed to effectively reduce the computational complexity of quantum kernels and enhance their scalability. In the proposed framework, classical data is first mapped to the quantum Hilbert space via parameterized quantum circuits, and the quantum kernel is defined based on the overlap of quantum states. Then, utilizing the Nyström approximation technique, the full kernel calculation is restricted to a representative subset of data, and the final learning process is conducted in the classical space. This approach reduces computational complexity from \(\:O\left({N}^{2}\right)\) to \(\:O\left(Nm\right)\), where N is the number of samples and m is the size of the selected subset. Analytical results and simulations on the Breast Cancer Wisconsin dataset demonstrate that the proposed framework reduces computational costs by over 60% while maintaining the geometric structure of the quantum feature space, with a classification accuracy loss of less than 3%. These results suggest that the proposed method can serve as a practical, scalable, and noise-resilient solution for applying quantum machine learning to real-world data-driven problems.

•Feb 18, 2026•0 citations

Quantum Machine Learning in Feature Hilbert Spaces

Maria Schuld, Nathan Killoran

A basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely, to efficiently perform computations in an intractably large Hilbert space. In this Letter we explore some theoretical foundations of this link and show how it opens up a new avenue for the design of quantum machine learning algorithms. We interpret the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space. A quantum computer can now analyze the input data in this feature space. Based on this link, we discuss two approaches for building a quantum model for classification. In the first approach, the quantum device estimates inner products of quantum states to compute a classically intractable kernel. The kernel can be fed into any classical kernel method such as a support vector machine. In the second approach, we use a variational quantum circuit as a linear model that classifies data explicitly in Hilbert space. We illustrate these ideas with a feature map based on squeezing in a continuous-variable system, and visualize the working principle with two-dimensional minibenchmark datasets.

arXiv:1803.07128•Physical Review Letters•Feb 1, 2019•2,212 citations
Abstract Amidst the array of quantum machine learning algorithms, the quantum kernel method has emerged as a focal point, primarily owing to its compatibility with noisy intermediate-scale quantum devices and its promise to achieve quantum advantage. This method operates by nonlinearly transforming data into feature space constructed with quantum states, enabling classification and regression tasks. In this study, we present a novel feature space constructed using Kerr coherent states, which generalize su(2), su(1,1) coherent states, and squeezed states. Notably, the feature space exhibits constant curvature, comprising both spherical and hyperbolic geometries, depending on the sign of the Kerr parameter. Remarkably, the physical parameters associated with the coherent states, enable control over the curvature of the feature space. Our study employs Kerr kernels derived from encoding data into the phase and amplitude of Kerr coherent states. We analyze various datasets ranging from Moon to breast cancer diagnostics. Our findings demonstrate the robustness of Kerr coherent states, attributed to their flexibility in accommodating different hyperparameters, thereby offering superior performance across noisy datasets and hardware setups.
Among various quantum machine learning (QML) algorithms, the quantum kernel method has especially attracted attention due to its compatibility with noisy intermediate-scale quantum devices and its potential to achieve quantum advantage. This method performs classification and regression by nonlinearly mapping data into quantum states in a higher-dimensional Hilbert space. Thus far, the quantum kernel method has been implemented only on qubit-based systems, but continuous-variable (CV) systems can potentially offer superior computational power by utilizing its infinite-dimensional Hilbert space. Here, we demonstrate the implementation of the classification task with the CV quantum kernel method on a programmable photonic quantum processor. We experimentally prove that the CV quantum kernel method successfully classifies several datasets robustly even under the experimental imperfections, with high accuracies comparable to the classical kernel. This demonstration sheds light on the utility of CV quantum systems for QML and should stimulate further study in other CV QML algorithms.
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.
The support vector machine (SVM) is a popular machine learning classification method which produces a nonlinear decision boundary in a feature space by constructing linear boundaries in a transformed Hilbert space. It is well known that these algorithms when executed on a classical computer do not scale well with the size of the feature space both in terms of data points and dimensionality. One of the most significant limitations of classical algorithms using non-linear kernels is that the kernel function has to be evaluated for all pairs of input feature vectors which themselves may be of substantially high dimension. This can lead to computationally excessive times during training and during the prediction process for a new data point. Here, we propose using both canonical and generalized coherent states to calculate specific nonlinear kernel functions. The key link will be the reproducing kernel Hilbert space (RKHS) property for SVMs that naturally arise from canonical and generalized coherent states. Specifically, we discuss the evaluation of radial kernels through a positive operator valued measure (POVM) on a quantum optical system based on canonical coherent states. A similar procedure may also lead to calculations of kernels not usually used in classical algorithms such as those arising from generalized coherent states.
Abstract In this paper, by mapping datasets to a set of non-linear coherent states, the process of encoding inputs in quantum states as a non-linear feature map is re-interpreted. As a result of the fact that the radial basis function is recovered when data is mapped to a complex Hilbert state represented by coherent states, non-linear coherent states can be considered as a natural generalisation of the associated kernels. In this paper, as an example of kernels based on non-linear coherent states, we propose kernel functions based on generalized hypergeometric functions, as orthogonal polynomial functions. The suggested kernel is implemented with the support vector machine (SVM) on two well known datasets (make_circles, and make_moons) and outperforms the baselines, even when the level of noise is high. In addition, we study the impact of the geometrical properties of the feature space, obtained by the non-linear coherent states, on the SVM classification task, by considering the Fubini–Study metric of the associated coherent states.
Abstract Quantum Machine Learning (QML) is an emerging field at the intersection of quantum computing and artificial intelligence, offering high potential for extracting complex nonlinear patterns from high-dimensional data. However, many quantum kernel-based methods suffer from high computational costs, the requirement for numerous quantum circuit executions, and the limitations of current Noisy Intermediate-Scale Quantum (NISQ) hardware. These challenges, particularly when dealing with large datasets, represent a major barrier to the widespread adoption of these methods in practical applications. In this paper, a hybrid quantum machine learning framework based on Nyström approximation is proposed to effectively reduce the computational complexity of quantum kernels and enhance their scalability. In the proposed framework, classical data is first mapped to the quantum Hilbert space via parameterized quantum circuits, and the quantum kernel is defined based on the overlap of quantum states. Then, utilizing the Nyström approximation technique, the full kernel calculation is restricted to a representative subset of data, and the final learning process is conducted in the classical space. This approach reduces computational complexity from  O(N2)\:O\left({N}^{2}\right)O(N2) to  O(Nm)\:O\left(Nm\right)O(Nm), where N is the number of samples and m is the size of the selected subset. Analytical results and simulations on the Breast Cancer Wisconsin dataset demonstrate that the proposed framework reduces computational costs by over 60% while maintaining the geometric structure of the quantum feature space, with a classification accuracy loss of less than 3%. These results suggest that the proposed method can serve as a practical, scalable, and noise-resilient solution for applying quantum machine learning to real-world data-driven problems.
A basic idea of quantum computing is surprisingly similar to that of kernel methods in machine learning, namely, to efficiently perform computations in an intractably large Hilbert space. In this Letter we explore some theoretical foundations of this link and show how it opens up a new avenue for the design of quantum machine learning algorithms. We interpret the process of encoding inputs in a quantum state as a nonlinear feature map that maps data to quantum Hilbert space. A quantum computer can now analyze the input data in this feature space. Based on this link, we discuss two approaches for building a quantum model for classification. In the first approach, the quantum device estimates inner products of quantum states to compute a classically intractable kernel. The kernel can be fed into any classical kernel method such as a support vector machine. In the second approach, we use a variational quantum circuit as a linear model that classifies data explicitly in Hilbert space. We illustrate these ideas with a feature map based on squeezing in a continuous-variable system, and visualize the working principle with two-dimensional minibenchmark datasets.