Quantum kernels with squeezed-state encoding for machine learning

• URL: http://arxiv.org/abs/2108.11114v1
• Date: Wed, 25 Aug 2021 08:24:54 GMT
• Title: Quantum kernels with squeezed-state encoding for machine learning
• Authors: Long Hin Li, Dan-Bo Zhang and Z. D. Wang
• Abstract summary: We generalize quantum kernel methods by encoding data into continuous-variable quantum states. The kernels can be calculated on a quantum computer and then are combined with classical machine learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Kernel methods are powerful for machine learning, as they can represent data in feature spaces that similarities between samples may be faithfully captured. Recently, it is realized that machine learning enhanced by quantum computing is closely related to kernel methods, where the exponentially large Hilbert space turns to be a feature space more expressive than classical ones. In this paper, we generalize quantum kernel methods by encoding data into continuous-variable quantum states, which can benefit from the infinite-dimensional Hilbert space of continuous variables. Specially, we propose squeezed-state encoding, in which data is encoded as either in the amplitude or the phase. The kernels can be calculated on a quantum computer and then are combined with classical machine learning, e.g. support vector machine, for training and predicting tasks. Their comparisons with other classical kernels are also addressed. Lastly, we discuss physical implementations of squeezed-state encoding for machine learning in quantum platforms such as trapped ions.

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)
• 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)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• 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)
• The Inductive Bias of Quantum Kernels [0.0]
  We analyze function classes defined via quantum kernels. We show that finding suitable quantum kernels is not easy because the kernel evaluation might require exponentially many measurements.
  arXiv  Detail & Related papers  (2021-06-07T16:14:32Z)
• 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)
• Quantum-enhanced bosonic learning machine [0.0]
  We show a quantum-enhanced bosonic learning machine operating on quantum data with a system of trapped ions. We implement the unsupervised K-means algorithm to recognize a pattern in a set of high-dimensional quantum states. We use the discovered knowledge to classify unknown quantum states with the supervised k-NN algorithm.
  arXiv  Detail & Related papers  (2021-04-09T02:44:57Z)
• 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)
• Nearest Centroid Classification on a Trapped Ion Quantum Computer [57.5195654107363]
  We design a quantum Nearest Centroid classifier, using techniques for efficiently loading classical data into quantum states and performing distance estimations. We experimentally demonstrate it on a 11-qubit trapped-ion quantum machine, matching the accuracy of classical nearest centroid classifiers for the MNIST handwritten digits dataset and achieving up to 100% accuracy for 8-dimensional synthetic data.
  arXiv  Detail & Related papers  (2020-12-08T01:10:30Z)

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.