On the Sample Complexity of Quantum Boltzmann Machine Learning

• URL: http://arxiv.org/abs/2306.14969v3
• Date: Thu, 22 Aug 2024 15:18:11 GMT
• Title: On the Sample Complexity of Quantum Boltzmann Machine Learning
• Authors: Luuk Coopmans, Marcello Benedetti,
• Abstract summary: We give an operational definition of QBM learning in terms of the difference in expectation values between the model and target. We prove that a solution can be obtained with gradient descent using at most a number of Gibbs states. In particular, we give pre-training strategies based on mean-field, Gaussian Fermionic, and geometrically local Hamiltonians.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum Boltzmann machines (QBMs) are machine-learning models for both classical and quantum data. We give an operational definition of QBM learning in terms of the difference in expectation values between the model and target, taking into account the polynomial size of the data set. By using the relative entropy as a loss function this problem can be solved without encountering barren plateaus. We prove that a solution can be obtained with stochastic gradient descent using at most a polynomial number of Gibbs states. We also prove that pre-training on a subset of the QBM parameters can only lower the sample complexity bounds. In particular, we give pre-training strategies based on mean-field, Gaussian Fermionic, and geometrically local Hamiltonians. We verify these models and our theoretical findings numerically on a quantum and a classical data set. Our results establish that QBMs are promising machine learning models.

Related papers

• ShadowGPT: Learning to Solve Quantum Many-Body Problems from Randomized Measurements [2.1946359779523332]
  We propose ShadowGPT, a novel approach for solving quantum many-body problems by learning from randomized measurement data collected from quantum experiments. The model is a generative pretrained transformer (GPT) trained on simulated classical shadow data of ground states of quantum Hamiltonians.
  arXiv  Detail & Related papers  (2024-11-05T17:34:03Z)
• Fourier Neural Operators for Learning Dynamics in Quantum Spin Systems [77.88054335119074]
  We use FNOs to model the evolution of random quantum spin systems. We apply FNOs to a compact set of Hamiltonian observables instead of the entire $2n$ quantum wavefunction.
  arXiv  Detail & Related papers  (2024-09-05T07:18:09Z)
• Training Quantum Boltzmann Machines with the $β$-Variational Quantum Eigensolver [0.3670008893193884]
  The quantum Boltzmann machine (QBM) is a generative machine learning model for both classical data and quantum states. We show that low-rank representations obtained by $beta$-VQE provide an efficient way to learn low-rank target states. We implement a trained model on a physical quantum device.
  arXiv  Detail & Related papers  (2023-04-17T21:56:52Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Fermionic approach to variational quantum simulation of Kitaev spin models [50.92854230325576]
  Kitaev spin models are well known for being exactly solvable in a certain parameter regime via a mapping to free fermions. We use classical simulations to explore a novel variational ansatz that takes advantage of this fermionic representation. We also comment on the implications of our results for simulating non-Abelian anyons on quantum computers.
  arXiv  Detail & Related papers  (2022-04-11T18:00:01Z)
• Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time-Series [19.830330492689978]
  We propose a quantum algorithm for sampling from a solution of differential equations (SDEs) We represent the quantile function for an underlying probability distribution and extract samples as expectation values. We test the method by simulating the Ornstein-Uhlenbeck process and sampling at times different from the initial point.
  arXiv  Detail & Related papers  (2021-08-06T16:14:24Z)
• Variational Quantum Boltzmann Machines [0.8057006406834467]
  This work presents a novel realization approach to Quantum Boltzmann Machines (QBMs) The preparation of the required Gibbs states, as well as the evaluation of the loss function's analytic gradient is based on Variational Quantum Imaginary Time Evolution. We illustrate the application of this variational QBM approach to generative and discriminative learning tasks using numerical simulation.
  arXiv  Detail & Related papers  (2020-06-10T18:00:09Z)
• Sample-efficient learning of quantum many-body systems [17.396274240172122]
  We study the problem of learning the Hamiltonian of a quantum many-body system given samples from its Gibbs state. We give the first sample-efficient algorithm for the quantum Hamiltonian learning problem.
  arXiv  Detail & Related papers  (2020-04-15T18:01:59Z)

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.