Variational Quantum Kernels with Task-Specific Quantum Metric Learning
- URL: http://arxiv.org/abs/2211.05225v1
- Date: Tue, 8 Nov 2022 18:36:25 GMT
- Title: Variational Quantum Kernels with Task-Specific Quantum Metric Learning
- Authors: Daniel T. Chang
- Abstract summary: Kernel methods rely on the notion of similarity between points in a higher (possibly infinite) dimensional feature space.
We discuss the use of variational quantum kernels with task-specific quantum metric learning to generate optimal quantum embeddings.
- Score: 0.8722210937404288
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum kernel methods, i.e., kernel methods with quantum kernels, offer
distinct advantages as a hybrid quantum-classical approach to quantum machine
learning (QML), including applicability to Noisy Intermediate-Scale Quantum
(NISQ) devices and usage for solving all types of machine learning problems.
Kernel methods rely on the notion of similarity between points in a higher
(possibly infinite) dimensional feature space. For machine learning, the notion
of similarity assumes that points close in the feature space should be close in
the machine learning task space. In this paper, we discuss the use of
variational quantum kernels with task-specific quantum metric learning to
generate optimal quantum embeddings (a.k.a. quantum feature encodings) that are
specific to machine learning tasks. Such task-specific optimal quantum
embeddings, implicitly supporting feature selection, are valuable not only to
quantum kernel methods in improving the latter's performance, but they can also
be valuable to non-kernel QML methods based on parameterized quantum circuits
(PQCs) as pretrained embeddings and for transfer learning. This further
demonstrates the quantum utility, and quantum advantage (with
classically-intractable quantum embeddings), of quantum kernel methods.
Related papers
Err
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.