Evolved Quantum Boltzmann Machines

• URL: http://arxiv.org/abs/2501.03367v2
• Date: Wed, 19 Feb 2025 20:20:01 GMT
• Title: Evolved Quantum Boltzmann Machines
• Authors: Michele Minervini, Dhrumil Patel, Mark M. Wilde,
• Abstract summary: We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. We show how the gradient for these tasks can be estimated by means of quantum algorithms that involve classical sampling, Hamiltonian simulation, and the Hadamard test. We also establish analytical expressions for the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrix elements of evolved quantum Boltzmann machines.
• Score: 3.481985817302898
• License:
• Abstract: We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. Given two parameterized Hamiltonians $G(\theta)$ and $H(\phi)$, an evolved quantum Boltzmann machine consists of preparing a thermal state of the first Hamiltonian $G(\theta)$ followed by unitary evolution according to the second Hamiltonian $H(\phi)$. Alternatively, one can think of it as first realizing imaginary time evolution according to $G(\theta)$ followed by real time evolution according to $H(\phi)$. After defining this ansatz, we provide analytical expressions for the gradient vector and illustrate their application in ground-state energy estimation and generative modeling, showing how the gradient for these tasks can be estimated by means of quantum algorithms that involve classical sampling, Hamiltonian simulation, and the Hadamard test. We also establish analytical expressions for the Fisher-Bures, Wigner-Yanase, and Kubo-Mori information matrix elements of evolved quantum Boltzmann machines, as well as quantum algorithms for estimating each of them, which leads to at least three different general natural gradient descent algorithms based on this ansatz. Along the way, we establish a broad generalization of the main result of [Luo, Proc. Am. Math. Soc. 132, 885 (2004)], proving that the Fisher-Bures and Wigner-Yanase information matrices of general parameterized families of states differ by no more than a factor of two in the matrix (Loewner) order, making them essentially interchangeable for training when using natural gradient descent.

Related papers

• Accelerating quantum imaginary-time evolution with random measurements [0.8874671354802571]
  Quantum imaginary-time evolution (QITE) is a promising tool to prepare thermal or ground states of Hamiltonians. We accelerate QITE by rapid estimation of the quantum Fisher information matrix (QFIM) We propose the random-measurement imaginary-time evolution (RMITE) algorithm, which we showcase and test in several molecular systems.
  arXiv  Detail & Related papers  (2024-07-03T14:06:32Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• On sampling determinantal and Pfaffian point processes on a quantum computer [49.1574468325115]
  DPPs were introduced by Macchi as a model in quantum optics the 1970s. Most applications require sampling from a DPP, and given their quantum origin, it is natural to wonder whether sampling a DPP on a classical computer is easier than on a classical one. Vanilla sampling consists in two steps, of respective costs $mathcalO(N3)$ and $mathcalO(Nr2)$ operations on a classical computer, where $r$ is the rank of the kernel matrix.
  arXiv  Detail & Related papers  (2023-05-25T08:43:11Z)
• The complexity of quantum support vector machines [1.7887848708497243]
  Quantum support vector machines employ quantum circuits to define the kernel function. We show that the dual problem can be solved in $O(M4.67/varepsilon2)$ quantum circuit evaluations.
  arXiv  Detail & Related papers  (2022-02-28T19:01:17Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• F-Divergences and Cost Function Locality in Generative Modelling with Quantum Circuits [0.0]
  We consider training a quantum circuit Born machine using $f$-divergences. We introduce two algorithms which demonstrably improve the training of the Born machine. We discuss the long-term implications of quantum devices for computing $f$-divergences.
  arXiv  Detail & Related papers  (2021-10-08T17:04:18Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Algorithm for initializing a generalized fermionic Gaussian state on a quantum computer [0.0]
  We present explicit expressions for the central piece of a variational method developed by Shi et al. We derive iterative analytical expressions for the evaluation of expectation values of products of fermionic creation and subroutine operators. We present a simple gradient-descent-based algorithm that can be used as an optimization in combination with imaginary time evolution.
  arXiv  Detail & Related papers  (2021-05-27T10:31:45Z)
• Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
  We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
  arXiv  Detail & Related papers  (2021-02-25T03:17:25Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18: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.