Non-parametric Active Learning and Rate Reduction in Many-body Hilbert Space with Rescaled Logarithmic Fidelity

• URL: http://arxiv.org/abs/2107.00195v1
• Date: Thu, 1 Jul 2021 03:13:16 GMT
• Title: Non-parametric Active Learning and Rate Reduction in Many-body Hilbert Space with Rescaled Logarithmic Fidelity
• Authors: Wei-Ming Li and Shi-Ju Ran
• Abstract summary: In quantum and quantum-inspired machine learning, the very first step is to embed the data in quantum space known as Hilbert space. We propose the rescaled logarithmic fidelity (RLF) and a non-parametric active learning in the quantum space, which we name as RLF-NAL. Our results imply that the machine learning in the Hilbert space complies with the principles of maximal coding rate reduction.
• Score: 4.781805457699204
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In quantum and quantum-inspired machine learning, the very first step is to embed the data in quantum space known as Hilbert space. Developing quantum kernel function (QKF), which defines the distances among the samples in the Hilbert space, belongs to the fundamental topics for machine learning. In this work, we propose the rescaled logarithmic fidelity (RLF) and a non-parametric active learning in the quantum space, which we name as RLF-NAL. The rescaling takes advantage of the non-linearity of the kernel to tune the mutual distances of samples in the Hilbert space, and meanwhile avoids the exponentially-small fidelities between quantum many-qubit states. We compare RLF-NAL with several well-known non-parametric algorithms including naive Bayes classifiers, $k$-nearest neighbors, and spectral clustering. Our method exhibits excellent accuracy particularly for the unsupervised case with no labeled samples and the few-shot cases with small numbers of labeled samples. With the visualizations by t-SNE, our results imply that the machine learning in the Hilbert space complies with the principles of maximal coding rate reduction, where the low-dimensional data exhibit within-class compressibility, between-class discrimination, and overall diversity. Our proposals can be applied to other quantum and quantum-inspired machine learning, including the methods using the parametric models such as tensor networks, quantum circuits, and quantum neural networks.

Related papers

• 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)
• Continuous-variable quantum kernel method on a programmable photonic quantum processor [0.0]
  We experimentally prove that the CV quantum kernel method successfully classifies several datasets robustly even under the experimental imperfections. This demonstration sheds light on the utility of CV quantum systems for QML and should stimulate further study in other CV QML algorithms.
  arXiv  Detail & Related papers  (2024-05-02T08:33:31Z)
• Quantum Simulations in Effective Model Spaces (I): Hamiltonian Learning-VQE using Digital Quantum Computers and Application to the Lipkin-Meshkov-Glick Model [0.0]
  We introduce an iterative hybrid-classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE) HL-VQE is found to provide an exponential improvement in Lipkin-Meshkov-Glick model calculations. This work constitutes a step in the development of entanglement-driven quantum algorithms for the description of nuclear systems.
  arXiv  Detail & Related papers  (2023-01-14T21:10:02Z)
• 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)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43: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)
• Scalable approach to many-body localization via quantum data [69.3939291118954]
  Many-body localization is a notoriously difficult phenomenon from quantum many-body physics. We propose a flexible neural network based learning approach that circumvents any computationally expensive step. Our approach can be applied to large-scale quantum experiments to provide new insights into quantum many-body physics.
  arXiv  Detail & Related papers  (2022-02-17T19:00:09Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Tree tensor network classifiers for machine learning: from quantum-inspired to quantum-assisted [0.0]
  We describe a quantum-assisted machine learning (QAML) method in which multivariate data is encoded into quantum states in a Hilbert space whose dimension is exponentially large in the length of the data vector. We present an approach that can be implemented on gate-based quantum computing devices.
  arXiv  Detail & Related papers  (2021-04-06T02:31:48Z)
• Efficient and Flexible Approach to Simulate Low-Dimensional Quantum Lattice Models with Large Local Hilbert Spaces [0.08594140167290096]
  We introduce a mapping that allows to construct artificial $U(1)$ symmetries for any type of lattice model. Exploiting the generated symmetries, numerical expenses that are related to the local degrees of freedom decrease significantly. Our findings motivate an intuitive physical picture of the truncations occurring in typical algorithms.
  arXiv  Detail & Related papers  (2020-08-19T14:13:56Z)
• Quantum embeddings for machine learning [5.16230883032882]
  Quantum classifiers are trainable quantum circuits used as machine learning models. We propose to train the first part of the circuit -- the embedding -- with the objective of maximally separating data classes in Hilbert space. This approach provides a powerful analytic framework for quantum machine learning.
  arXiv  Detail & Related papers  (2020-01-10T19:00:01Z)

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.