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:2108.11114 · Physics Letters A

Quantum kernels with Gaussian state encoding for machine learning

Long Hin Li, Dan-Bo Zhang, Z.D. Wang

Published Mar 24, 2022• 19 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2022.128088

Related papers

Error mitigation for quantum kernel based machine learning methods on IonQ and IBM quantum computers

Sasan Moradi, C. Brandner, Macauley Coggins +3 more

Kernel methods are the basis of most classical machine learning algorithms such as Gaussian Process (GP) and Support Vector Machine (SVM). Computing kernels using noisy intermediate scale quantum (NISQ) devices has attracted considerable attention due to recent progress in the design of NISQ devices. However noise and errors on current NISQ devices can negatively affect the predicted kernels. In this paper we utilize two quantum kernel machine learning (ML) algorithms to predict the labels of a Breast Cancer dataset on two different NISQ devices: quantum kernel Gaussian Process (qkGP) and quantum kernel Support Vector Machine (qkSVM). We estimate the quantum kernels on the 11 qubit IonQ and the 5 qubit IBMQ Belem quantum devices. Our results demonstrate that the predictive performances of the error mitigated quantum kernel machine learning algorithms improve significantly compared to their non-error mitigated counterparts. On both NISQ devices the predictive performances became comparable to those of noiseless quantum simulators and their classical counterparts

arXiv:2206.01573•Jun 3, 2022•9 citations

Kernel methods in Quantum Machine Learning

Riccardo Mengoni, Alessandra Di Pierro

Quantum Machine Intelligence•Nov 15, 2019•73 citations

Quantum Kernel Machine Learning With Continuous Variables

Laura J. Henderson, Rishi Goel, Sally Shrapnel

The popular qubit framework has dominated recent work on quantum kernel machine learning, with results characterising expressivity, learnability and generalisation. As yet, there is no comparative framework to understand these concepts for continuous variable (CV) quantum computing platforms. In this paper we represent CV quantum kernels as closed form functions and use this representation to provide several important theoretical insights. We derive a general closed form solution for all CV quantum kernels and show every such kernel can be expressed as the product of a Gaussian and an algebraic function of the parameters of the feature map. Furthermore, in the multi-mode case, we present quantification of a quantum-classical separation for all quantum kernels via a hierarchical notion of the “stellar rank" of the quantum kernel feature map. We then prove kernels defined by feature maps of infinite stellar rank, such as GKP-state encodings, can be approximated arbitrarily well by kernels defined by feature maps of finite stellar rank. Finally, we simulate learning with a single-mode displaced Fock state encoding and show that (i) accuracy on our specific task (an annular data set) increases with stellar rank, (ii) for underfit models, accuracy can be improved by increasing a bandwidth hyperparameter, and (iii) for noisy data that is overfit, decreasing the bandwidth will improve generalisation but does so at the cost of effective stellar rank.

arXiv:2401.05647•Quantum•Dec 17, 2024•11 citations

Quantum semi-supervised kernel learning

Seyran Saeedi, Aliakbar Panahi, Tom J. Arodz

arXiv:2204.10700•Quantum Machine Intelligence•Oct 7, 2021•12 citations

Towards quantum machine learning

Michael Brooks

Nature•May 24, 2023•4 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
Kernel methods are the basis of most classical machine learning algorithms such as Gaussian Process (GP) and Support Vector Machine (SVM). Computing kernels using noisy intermediate scale quantum (NISQ) devices has attracted considerable attention due to recent progress in the design of NISQ devices. However noise and errors on current NISQ devices can negatively affect the predicted kernels. In this paper we utilize two quantum kernel machine learning (ML) algorithms to predict the labels of a Breast Cancer dataset on two different NISQ devices: quantum kernel Gaussian Process (qkGP) and quantum kernel Support Vector Machine (qkSVM). We estimate the quantum kernels on the 11 qubit IonQ and the 5 qubit IBMQ Belem quantum devices. Our results demonstrate that the predictive performances of the error mitigated quantum kernel machine learning algorithms improve significantly compared to their non-error mitigated counterparts. On both NISQ devices the predictive performances became comparable to those of noiseless quantum simulators and their classical counterparts
The popular qubit framework has dominated recent work on quantum kernel machine learning, with results characterising expressivity, learnability and generalisation. As yet, there is no comparative framework to understand these concepts for continuous variable (CV) quantum computing platforms. In this paper we represent CV quantum kernels as closed form functions and use this representation to provide several important theoretical insights. We derive a general closed form solution for all CV quantum kernels and show every such kernel can be expressed as the product of a Gaussian and an algebraic function of the parameters of the feature map. Furthermore, in the multi-mode case, we present quantification of a quantum-classical separation for all quantum kernels via a hierarchical notion of the “stellar rank" of the quantum kernel feature map. We then prove kernels defined by feature maps of infinite stellar rank, such as GKP-state encodings, can be approximated arbitrarily well by kernels defined by feature maps of finite stellar rank. Finally, we simulate learning with a single-mode displaced Fock state encoding and show that (i) accuracy on our specific task (an annular data set) increases with stellar rank, (ii) for underfit models, accuracy can be improved by increasing a bandwidth hyperparameter, and (iii) for noisy data that is overfit, decreasing the bandwidth will improve generalisation but does so at the cost of effective stellar rank.
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.