Quantum machine learning beyond kernel methods
- URL: http://arxiv.org/abs/2110.13162v1
- Date: Mon, 25 Oct 2021 18:00:02 GMT
- Title: Quantum machine learning beyond kernel methods
- Authors: Sofiene Jerbi, Lukas J. Fiderer, Hendrik Poulsen Nautrup, Jonas M.
K\"ubler, Hans J. Briegel, Vedran Dunjko
- Abstract summary: We show that parametrized quantum circuit models can exhibit a critically better generalization performance than their kernel formulations.
Our results constitute another step towards a more comprehensive theory of quantum machine learning models next to kernel formulations.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With noisy intermediate-scale quantum computers showing great promise for
near-term applications, a number of machine learning algorithms based on
parametrized quantum circuits have been suggested as possible means to achieve
learning advantages. Yet, our understanding of how these quantum machine
learning models compare, both to existing classical models and to each other,
remains limited. A big step in this direction has been made by relating them to
so-called kernel methods from classical machine learning. By building on this
connection, previous works have shown that a systematic reformulation of many
quantum machine learning models as kernel models was guaranteed to improve
their training performance. In this work, we first extend the applicability of
this result to a more general family of parametrized quantum circuit models
called data re-uploading circuits. Secondly, we show, through simple
constructions and numerical simulations, that models defined and trained
variationally can exhibit a critically better generalization performance than
their kernel formulations, which is the true figure of merit of machine
learning tasks. Our results constitute another step towards a more
comprehensive theory of quantum machine learning models next to kernel
formulations.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - Large-scale quantum reservoir learning with an analog quantum computer [45.21335836399935]
We develop a quantum reservoir learning algorithm that harnesses the quantum dynamics of neutral-atom analog quantum computers to process data.
We experimentally implement the algorithm, achieving competitive performance across various categories of machine learning tasks.
Our findings demonstrate the potential of utilizing classically intractable quantum correlations for effective machine learning.
arXiv Detail & Related papers (2024-07-02T18:00:00Z) - Symmetry-invariant quantum machine learning force fields [0.0]
We design quantum neural networks that explicitly incorporate, as a data-inspired prior, an extensive set of physically relevant symmetries.
Our results suggest that molecular force fields generation can significantly profit from leveraging the framework of geometric quantum machine learning.
arXiv Detail & Related papers (2023-11-19T16:15:53Z) - Shadows of quantum machine learning [2.236957801565796]
We introduce a new class of quantum models where quantum resources are only required during training, while the deployment of the trained model is classical.
We prove that this class of models is universal for classically-deployed quantum machine learning.
arXiv Detail & Related papers (2023-05-31T18:00:02Z) - A Framework for Demonstrating Practical Quantum Advantage: Racing
Quantum against Classical Generative Models [62.997667081978825]
We build over a proposed framework for evaluating the generalization performance of generative models.
We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models.
Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
arXiv Detail & Related papers (2023-03-27T22:48:28Z) - The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for
Deep Quantum Machine Learning [52.77024349608834]
Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing.
Key issue is how to address the inherent non-linearity of classical deep learning.
We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
arXiv Detail & Related papers (2022-12-22T16:06:24Z) - A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
We focus on the case of learning with a single qubit, using data re-uploading techniques.
We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
arXiv Detail & Related papers (2022-11-23T18:25:32Z) - Generative model for learning quantum ensemble via optimal transport
loss [0.9404723842159504]
We propose a quantum generative model that can learn quantum ensemble.
The proposed model paves the way for a wide application such as the health check of quantum devices.
arXiv Detail & Related papers (2022-10-19T17:35:38Z) - Modern applications of machine learning in quantum sciences [51.09906911582811]
We cover the use of deep learning and kernel methods in supervised, unsupervised, and reinforcement learning algorithms.
We discuss more specialized topics such as differentiable programming, generative models, statistical approach to machine learning, and quantum machine learning.
arXiv Detail & Related papers (2022-04-08T17:48:59Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Quantum machine learning models are kernel methods [0.0]
This technical manuscript summarises, formalises and extends the link by systematically rephrasing quantum models as a kernel method.
It shows that most near-term and fault-tolerant quantum models can be replaced by a general support vector machine.
In particular, kernel-based training is guaranteed to find better or equally good quantum models than variational circuit training.
arXiv Detail & Related papers (2021-01-26T19:00:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.