On the expressivity of embedding quantum kernels

• URL: http://arxiv.org/abs/2309.14419v2
• Date: Tue, 9 Apr 2024 09:45:34 GMT
• Title: On the expressivity of embedding quantum kernels
• Authors: Elies Gil-Fuster, Jens Eisert, Vedran Dunjko,
• Abstract summary: We find that for any kernel function there always exists a corresponding quantum feature map and an embedding quantum kernel. For shift-invariant kernels, we use the technique of random Fourier features to show that they are universal within the broad class of all kernels. We extend this result to a new class of so-called composition kernels, which we show also contains projected quantum kernels introduced in recent works.
• Score: 1.6385815610837167
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the most natural connections between quantum and classical machine learning has been established in the context of kernel methods. Kernel methods rely on kernels, which are inner products of feature vectors living in large feature spaces. Quantum kernels are typically evaluated by explicitly constructing quantum feature states and then taking their inner product, here called embedding quantum kernels. Since classical kernels are usually evaluated without using the feature vectors explicitly, we wonder how expressive embedding quantum kernels are. In this work, we raise the fundamental question: can all quantum kernels be expressed as the inner product of quantum feature states? Our first result is positive: Invoking computational universality, we find that for any kernel function there always exists a corresponding quantum feature map and an embedding quantum kernel. The more operational reading of the question is concerned with efficient constructions, however. In a second part, we formalize the question of universality of efficient embedding quantum kernels. For shift-invariant kernels, we use the technique of random Fourier features to show that they are universal within the broad class of all kernels which allow a variant of efficient Fourier sampling. We then extend this result to a new class of so-called composition kernels, which we show also contains projected quantum kernels introduced in recent works. After proving the universality of embedding quantum kernels for both shift-invariant and composition kernels, we identify the directions towards new, more exotic, and unexplored quantum kernel families, for which it still remains open whether they correspond to efficient embedding quantum kernels.

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)
• 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)
• Quantum Kernel Machine Learning With Continuous Variables [0.0]
  The popular qubit framework has dominated recent work on quantum kernel machine learning. There is no comparative framework to understand these concepts for continuous variable (CV) quantum computing platforms.
  arXiv  Detail & Related papers  (2024-01-11T03:49:40Z)
• A Unified Framework for Trace-induced Quantum Kernels [0.0]
  Quantum kernel methods are promising candidates for achieving a practical quantum advantage for certain machine learning tasks. In this work we combine all trace-induced quantum kernels into a common framework. We show numerically that models based on local projected kernels can achieve comparable performance to the global fidelity quantum kernel.
  arXiv  Detail & Related papers  (2023-11-22T17:50:00Z)
• 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)
• Numerical evidence against advantage with quantum fidelity kernels on classical data [12.621805903645711]
  We show that quantum kernels suffer from exponential "flattening" of the spectrum as the number of qubits grows. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data.
  arXiv  Detail & Related papers  (2022-11-29T19:23:11Z)
• 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)
• Genuine multipartite entanglement and quantum coherence in an electron-positron system: Relativistic covariance [117.44028458220427]
  We analyze the behavior of both genuine multipartite entanglement and quantum coherence under Lorentz boosts. A given combination of these quantum resources is shown to form a Lorentz invariant.
  arXiv  Detail & Related papers  (2021-11-26T17:22:59Z)
• Covariant quantum kernels for data with group structure [1.51714450051254]
  We introduce a class of quantum kernels that can be used for data with a group structure. We apply this method to a learning problem on a coset-space that embodies the structure of many essential learning problems on groups.
  arXiv  Detail & Related papers  (2021-05-07T17:38:58Z)
• Training Quantum Embedding Kernels on Near-Term Quantum Computers [0.08563354084119063]
  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.
  arXiv  Detail & Related papers  (2021-05-05T18:41:13Z)
• 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)

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.