Fundamentals of quantum Boltzmann machine learning with visible and hidden units

• URL: http://arxiv.org/abs/2512.19819v1
• Date: Mon, 22 Dec 2025 19:16:21 GMT
• Title: Fundamentals of quantum Boltzmann machine learning with visible and hidden units
• Authors: Mark M. Wilde,
• Abstract summary: Training relies on estimating the gradient of the relative entropy between the target and model distributions.<n>For some years now, it has been an obstacle to generalize this finding to quantum state learning with quantum Boltzmann machines that have both visible and hidden units.<n>I derive an analytical expression for the gradient of the quantum relative entropy between a target quantum state and the reduced state of the visible units of a quantum Boltzmann machine.
• Score: 13.706331473063882
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the primary applications of classical Boltzmann machines is generative modeling, wherein the goal is to tune the parameters of a model distribution so that it closely approximates a target distribution. Training relies on estimating the gradient of the relative entropy between the target and model distributions, a task that is well understood when the classical Boltzmann machine has both visible and hidden units. For some years now, it has been an obstacle to generalize this finding to quantum state learning with quantum Boltzmann machines that have both visible and hidden units. In this paper, I derive an analytical expression for the gradient of the quantum relative entropy between a target quantum state and the reduced state of the visible units of a quantum Boltzmann machine. Crucially, this expression is amenable to estimation on a quantum computer, as it involves modular-flow-generated unitary rotations reminiscent of those appearing in my prior work on rotated Petz recovery maps. This leads to a quantum algorithm for gradient estimation in this setting. I then specialize the setting to quantum visible units and classical hidden units, and vice versa, and provide analytical expressions for the gradients, along with quantum algorithms for estimating them. Finally, I replace the quantum relative entropy objective function with the Petz-Tsallis relative entropy; here I develop an analytical expression for the gradient and sketch a quantum algorithm for estimating it, as an application of a novel formula for the derivative of the matrix power function, which also involves modular-flow-generated unitary rotations. Ultimately, this paper demarcates progress in training quantum Boltzmann machines with visible and hidden units for generative modeling and quantum state learning.

Related papers

• Generative modeling using evolved quantum Boltzmann machines [13.706331473063882]
  Born-rule generative modeling is a central task in quantum machine learning.<n>I propose a practical solution that trains quantum Boltzmann machines for Born-rule generative modeling.
  arXiv  Detail & Related papers  (2025-12-02T12:56:02Z)
• Quantum Latent Diffusion Models [65.16624577812436]
  We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models.<n>This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space.<n>The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
  arXiv  Detail & Related papers  (2025-01-19T21:24:02Z)
• Quantum Boltzmann machine learning of ground-state energies [3.187381965457262]
  Esting the ground-state energy of Hamiltonians is a fundamental task for which quantum computers can be helpful. We analyze the performance of quantum Boltzmann machines for this task. Our algorithm estimates the gradient of the energy function efficiently by means of a novel quantum circuit construction.
  arXiv  Detail & Related papers  (2024-10-16T18:22:03Z)
• Quantum Tensor Product Decomposition from Choi State Tomography [0.0]
  We present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor product decomposition of a unitary. This quantum algorithm may be used to make predictions about operator non-locality, effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries.
  arXiv  Detail & Related papers  (2024-02-07T16:36:47Z)
• 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)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• 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)
• 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)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• 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)
• Effectively Trainable Semi-Quantum Restricted Boltzmann Machine [0.0]
  We propose a novel quantum model for the restricted Boltzmann machine (RBM) The visible units remain classical whereas the hidden units are quantized as noninteracting fermions. This model possesses a quantum behaviour such as coherences between the hidden units.
  arXiv  Detail & Related papers  (2020-01-24T13:38:48Z)

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.