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:1803.07128 · Physical Review Letters

Quantum Machine Learning in Feature Hilbert Spaces

Maria Schuld, Nathan Killoran

Published Feb 1, 2019• 1,856 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physrevlett.122.040504

Related papers

Quantum machine learning models are kernel methods

Maria Schuld

With near-term devices available and the race for fault-tolerant computers in full swing, researchers became interested in the question of what happens if we replace a machine learning model with a circuit. While such quantum are sometimes called quantum neural networks, it has been repeatedly noted that their mathematical structure is actually much more closely related to kernel methods: they analyse data in high-dimensional Hilbert spaces to which we only have access through inner products revealed by measurements. This technical manuscript summarises, formalises and extends the link by systematically rephrasing models as a kernel method. It shows that most near-term and fault-tolerant models can be replaced by a general support vector machine whose kernel computes distances between data-encoding states. In particular, kernel-based training is guaranteed to find better or equally good models than variational circuit training. Overall, the kernel perspective of machine learning tells us that the way that data is encoded into states is the main ingredient that can potentially set models apart from classical machine learning models.

•Jan 26, 2021•37 citations

Supervised quantum machine learning models are kernel methods

Maria Schuld

With near-term quantum devices available and the race for fault-tolerant quantum computers in full swing, researchers became interested in the question of what happens if we replace a supervised machine learning model with a quantum circuit. While such "quantum models" are sometimes called "quantum neural networks", it has been repeatedly noted that their mathematical structure is actually much more closely related to kernel methods: they analyse data in high-dimensional Hilbert spaces to which we only have access through inner products revealed by measurements. This technical manuscript summarises and extends the idea of systematically rephrasing supervised quantum models as a kernel method. With this, a lot of near-term and fault-tolerant quantum models can be replaced by a general support vector machine whose kernel computes distances between data-encoding quantum states. Kernel-based training is then guaranteed to find better or equally good quantum models than variational circuit training. Overall, the kernel perspective of quantum machine learning tells us that the way that data is encoded into quantum states is the main ingredient that can potentially set quantum models apart from classical machine learning models.

arXiv:2101.11020•Jan 26, 2021•173 citations

Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spaces

Takahiro Goto, Quoc Hoan Tran, Kohei Nakajima

Encoding classical data into quantum states is considered a quantum feature map to map classical data into a quantum Hilbert space. This feature map provides opportunities to incorporate quantum advantages into machine learning algorithms to be performed on near-term intermediate-scale quantum computers. The crucial idea is using the quantum Hilbert space as a quantum-enhanced feature space in machine learning models. Although the quantum feature map has demonstrated its capability when combined with linear classification models in some specific applications, its expressive power from the theoretical perspective remains unknown. We prove that the machine learning models induced from the quantum-enhanced feature space are universal approximators of continuous functions under typical quantum feature maps. We also study the capability of quantum feature maps in the classification of disjoint regions. Our work enables an important theoretical analysis to ensure that machine learning algorithms based on quantum feature maps can handle a broad class of machine learning tasks. In light of this, one can design a quantum machine learning model with more powerful expressivity.

arXiv:2009.00298•Physical Review Letters•Aug 27, 2021•86 citations

Feature Map for Quantum Data in Classification

Hyeokjea Kwon, Hojun Lee, Joonwoo Bae

The kernel trick in supervised learning signifies transformations of an inner product by a feature map, which then restructures training data in a larger Hilbert space according to an endowed inner product. A quantum feature map corresponds to an instance with a Hilbert space of quantum states by fueling quantum resources to machine learning algorithms. In this work, we point out that the quantum state space is specific such that a measurement postulate characterizes an inner product and that manipulation of quantum states prepared from classical data cannot enhance the distinguishability of data points. We present a feature map for quantum data as a probabilistic manipulation of quantum states to improve supervised learning algorithms.

arXiv:2303.15665•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•4 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

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
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.
With near-term devices available and the race for fault-tolerant computers in full swing, researchers became interested in the question of what happens if we replace a machine learning model with a circuit. While such quantum are sometimes called quantum neural networks, it has been repeatedly noted that their mathematical structure is actually much more closely related to kernel methods: they analyse data in high-dimensional Hilbert spaces to which we only have access through inner products revealed by measurements. This technical manuscript summarises, formalises and extends the link by systematically rephrasing models as a kernel method. It shows that most near-term and fault-tolerant models can be replaced by a general support vector machine whose kernel computes distances between data-encoding states. In particular, kernel-based training is guaranteed to find better or equally good models than variational circuit training. Overall, the kernel perspective of machine learning tells us that the way that data is encoded into states is the main ingredient that can potentially set models apart from classical machine learning models.
With near-term quantum devices available and the race for fault-tolerant quantum computers in full swing, researchers became interested in the question of what happens if we replace a supervised machine learning model with a quantum circuit. While such "quantum models" are sometimes called "quantum neural networks", it has been repeatedly noted that their mathematical structure is actually much more closely related to kernel methods: they analyse data in high-dimensional Hilbert spaces to which we only have access through inner products revealed by measurements. This technical manuscript summarises and extends the idea of systematically rephrasing supervised quantum models as a kernel method. With this, a lot of near-term and fault-tolerant quantum models can be replaced by a general support vector machine whose kernel computes distances between data-encoding quantum states. Kernel-based training is then guaranteed to find better or equally good quantum models than variational circuit training. Overall, the kernel perspective of quantum machine learning tells us that the way that data is encoded into quantum states is the main ingredient that can potentially set quantum models apart from classical machine learning models.
Encoding classical data into quantum states is considered a quantum feature map to map classical data into a quantum Hilbert space. This feature map provides opportunities to incorporate quantum advantages into machine learning algorithms to be performed on near-term intermediate-scale quantum computers. The crucial idea is using the quantum Hilbert space as a quantum-enhanced feature space in machine learning models. Although the quantum feature map has demonstrated its capability when combined with linear classification models in some specific applications, its expressive power from the theoretical perspective remains unknown. We prove that the machine learning models induced from the quantum-enhanced feature space are universal approximators of continuous functions under typical quantum feature maps. We also study the capability of quantum feature maps in the classification of disjoint regions. Our work enables an important theoretical analysis to ensure that machine learning algorithms based on quantum feature maps can handle a broad class of machine learning tasks. In light of this, one can design a quantum machine learning model with more powerful expressivity.
The kernel trick in supervised learning signifies transformations of an inner product by a feature map, which then restructures training data in a larger Hilbert space according to an endowed inner product. A quantum feature map corresponds to an instance with a Hilbert space of quantum states by fueling quantum resources to machine learning algorithms. In this work, we point out that the quantum state space is specific such that a measurement postulate characterizes an inner product and that manipulation of quantum states prepared from classical data cannot enhance the distinguishability of data points. We present a feature map for quantum data as a probabilistic manipulation of quantum states to improve supervised learning algorithms.
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.
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.