Training Quantum Embedding Kernels on Near-Term Quantum Computers

• URL: http://arxiv.org/abs/2105.02276v1
• Date: Wed, 5 May 2021 18:41:13 GMT
• Title: Training Quantum Embedding Kernels on Near-Term Quantum Computers
• Authors: Thomas Hubregtsen, David Wierichs, Elies Gil-Fuster, Peter-Jan H. S. Derks, Paul K. Faehrmann, Johannes Jakob Meyer
• Abstract summary: Quantum embedding kernels (QEKs) constructed by embedding data into the Hilbert space of a quantum computer are a particular quantum kernel technique. We first provide an accessible introduction to quantum embedding kernels and then analyze the practical issues arising when realizing them on a noisy near-term quantum computer.
• Score: 0.08563354084119063
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Kernel methods are a cornerstone of classical machine learning. The idea of using quantum computers to compute kernels has recently attracted attention. Quantum embedding kernels (QEKs) constructed by embedding data into the Hilbert space of a quantum computer are a particular quantum kernel technique that allows to gather insights into learning problems and that are particularly suitable for noisy intermediate-scale quantum devices. In this work, we first provide an accessible introduction to quantum embedding kernels and then analyze the practical issues arising when realizing them on a noisy near-term quantum computer. We focus on quantum embedding kernels with variational parameters. These variational parameters are optimized for a given dataset by increasing the kernel-target alignment, a heuristic connected to the achievable classification accuracy. We further show under which conditions noise from device imperfections influences the predicted kernel and provide a strategy to mitigate these detrimental effects which is tailored to quantum embedding kernels. We also address the influence of finite sampling and derive bounds that put guarantees on the quality of the kernel matrix. We illustrate our findings by numerical experiments and tests on actual hardware.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• In Search of Quantum Advantage: Estimating the Number of Shots in Quantum Kernel Methods [30.565491081930997]
  We develop an approach for estimating desired precision of kernel values, which is translated into the number of circuit runs. We stress that quantum kernel methods should not only be considered from the machine learning performance perspective, but also from the context of the resource consumption.
  arXiv  Detail & Related papers  (2024-07-22T16:29:35Z)
• Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
  We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation. We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture. We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
  arXiv  Detail & Related papers  (2024-05-31T16:43:20Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Neural auto-designer for enhanced quantum kernels [59.616404192966016]
  We present a data-driven approach that automates the design of problem-specific quantum feature maps. Our work highlights the substantial role of deep learning in advancing quantum machine learning.
  arXiv  Detail & Related papers  (2024-01-20T03:11:59Z)
• Quantum-Classical Multiple Kernel Learning [0.0]
  Kernel methods in machine learning is one area where such improvements could be realized in the future. Small and noisy quantum computers can evaluate classically-parametric quantum kernels that capture unique notions of similarity in data. We consider pairwise combinations of classical, quantum-quantum, quantum-classical and QC kernels in the context of multiple kernel (MKL) We show this approach to be effective for enhancing various metrics performance in an MKL setting.
  arXiv  Detail & Related papers  (2023-05-28T12:29:04Z)
• Variational Quantum Kernels with Task-Specific Quantum Metric Learning [0.8722210937404288]
  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.
  arXiv  Detail & Related papers  (2022-11-08T18:36:25Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• 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.