Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.02721

Generative modeling using evolved quantum Boltzmann machines

Mark M. Wilde

quant-phcs.LGmath.OCSubmitted Dec 2, 2025• Announced Dec 3, 2025• 5 citations
arXivHTMLPDF

Abstract

Born-rule generative modeling, a central task in quantum machine learning, seeks to learn probability distributions that can be efficiently sampled by measuring complex quantum states. One hope is for quantum models to efficiently capture probability distributions that are difficult to learn and simulate by classical means alone. Quantum Boltzmann machines were proposed about one decade ago for this purpose, yet efficient training methods have remained elusive. In this paper, I overcome this obstacle by proposing a practical solution that trains quantum Boltzmann machines for Born-rule generative modeling. Two key ingredients in the proposal are the Donsker-Varadhan variational representation of the classical relative entropy and the quantum Boltzmann gradient estimator of [Patel et al., arXiv:2410.12935]. I present the main result for a more general ansatz known as an evolved quantum Boltzmann machine [Minervini et al., arXiv:2501.03367], which combines parameterized real- and imaginary-time evolution. I also show how to extend the findings to other distinguishability measures beyond relative entropy. Finally, I present four different hybrid quantum-classical algorithms for the minimax optimization underlying training, and I discuss their theoretical convergence guarantees.

Comments
30 pages, 2 figures

Related papers

Evolved quantum Boltzmann machines

Michele Minervini, Dhrumil Patel, Mark M. Wilde

We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. Given two parameterized Hamiltonians $G(θ)$ and $H(ϕ)$, an evolved quantum Boltzmann machine consists of preparing a thermal state of the first Hamiltonian $G(θ)$ followed by unitary evolution according to the second Hamiltonian $H(ϕ)$. Alternatively, one can think of it as first realizing imaginary time evolution according to $G(θ)$ followed by real time evolution according to $H(ϕ)$. 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.

arXiv:2501.03367•Physical Review A•Jan 21, 2026•15 citations

Quantum Generative Models

Hamid D. Ismail

This chapter develops quantum generative models as a distinct paradigm within quantum machine learning (QML), emphasizing distribution learning and sampling rather than prediction. It begins by showing how quantum states naturally define probability distributions through the Born rule, thereby making sampling an intrinsic physical process rather than an auxiliary computational step. On this foundation, this chapter presents three principal frameworks: Quantum circuit Born machines (QCBMs), quantum generative adversarial networks (QGANs), and quantum Boltzmann machines (QBMs). QCBMs are introduced as the most direct and conceptually transparent generative models based on parameterized quantum circuits; QGANs extend adversarial learning into the quantum domain through generator–discriminator competition; and QBMs connect generative modeling to quantum statistical mechanics through Gibbs states and quantum Hamiltonians. This chapter compares these models in terms of expressivity, training stability, and hardware feasibility, highlighting the recurring tension between representational richness and practical trainability. It also examines key application areas, including synthetic data generation, scientific distribution learning, quantum simulation, and hybrid classical-quantum pipelines, while emphasizing major open challenges such as noise, sampling overhead, limited hardware scalability, and the absence of clearly demonstrated quantum advantage. Taken together, this chapter establishes generative modeling as a central pillar of QML.

CRC Press eBooks•Nov 4, 2026•0 citations

Quantum-classical generative models for machine learning

Marcello Benedetti

The combination of quantum and classical computational resources towards more effective algorithms is one of the most promising research directions in computer science. In such a hybrid framework, existing quantum computers can be used to their fullest extent and for practical applications. Generative modeling is one of the applications that could benefit the most, either by speeding up the underlying sampling methods or by unlocking more general models. In this work, we design a number of hybrid generative models and validate them on real hardware and datasets. The quantum-assisted Boltzmann machine is trained to generate realistic artificial images on quantum annealers. Several challenges in state-of-the-art annealers shall be overcome before one can assess their actual performance. We attack some of the most pressing challenges such as the sparse qubit-to-qubit connectivity, the unknown effective-temperature, and the noise on the control parameters. In order to handle datasets of realistic size and complexity, we include latent variables and obtain a more general model called the quantum-assisted Helmholtz machine. In the context of gate-based computers, the quantum circuit Born machine is trained to encode a target probability distribution in the wavefunction of a set of qubits. We implement this model on a trapped ion computer using low-depth circuits and native gates. We use the generative modeling performance on the canonical Bars-and-Stripes dataset to design a benchmark for hybrid systems. It is reasonable to expect that quantum data, i.e., datasets of wavefunctions, will become available in the future. We derive a quantum generative adversarial network that works with quantum data. Here, two circuits are optimized in tandem: one tries to generate suitable quantum states, the other tries to distinguish between target and generated states.

•Nov 28, 2019•3 citations

Quantum Boltzmann machine learning of ground-state energies

Anonymous

Estimating the ground-state energy of Hamiltonians is a fundamental task for which it is believed that quantum computers can be helpful. Several approaches have been proposed toward this goal, including algorithms based on quantum phase estimation and hybrid quantum-classical optimizers involving parameterized quantum circuits, the latter falling under the umbrella of the variational quantum eigensolver. Here, we analyze the performance of quantum Boltzmann machines for this task, which is a less explored ansatz based on parameterized thermal states and which is not known to suffer from the barren-plateau problem. We delineate a hybrid quantum-classical algorithm for this task and rigorously prove that it converges to an $\varepsilon$-approximate stationary point of the energy function optimized over parameter space, while using a number of parameterized-thermal-state samples that is polynomial in $\varepsilon^{-1}$, the number of parameters, and the norm of the Hamiltonian being optimized. Our algorithm estimates the gradient of the energy function efficiently by means of a quantum circuit construction that combines classical random sampling, Hamiltonian simulation, and the Hadamard test. Additionally, supporting our main claims are calculations of the gradient and Hessian of the energy function, as well as an upper bound on the matrix elements of the latter that is used in the convergence analysis.

arXiv:2410.12935•Physical Review A•Aug 27, 2026•26 citations

Training quantum Boltzmann machines with the β-variational quantum eigensolver

Onno Huijgen, Luuk Coopmans, Peyman Najafi +2 more

Abstract The quantum Boltzmann machine (QBM) is a generative machine learning model for both classical data and quantum states. Training the QBM consists of minimizing the relative entropy from the model to the target state. This requires QBM expectation values which are computationally intractable for large models in general. It is therefore important to develop heuristic training methods that work well in practice. In this work, we study a heuristic method characterized by a nested loop: the inner loop trains the β-variational quantum eigensolver (β-VQE) by Liu et al (2021 Mach. Learn.: Sci. Technol. 2 025011) to approximate the QBM expectation values; the outer loop trains the QBM to minimize the relative entropy to the target. We show that low-rank representations obtained by β-VQE provide an efficient way to learn low-rank target states, such as classical data and low-temperature quantum tomography. We test the method on both classical and quantum target data with numerical simulations of up to 10 qubits. For the cases considered here, the obtained QBMs can model the target to high fidelity. We implement a trained model on a physical quantum device. The approach offers a valuable route towards variationally training QBMs on near-term quantum devices.

arXiv:2304.08631•Machine Learning Science and Technology•Mar 22, 2024•9 citations

Fundamentals of quantum Boltzmann machine learning with visible and hidden units

Mark M. Wilde

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; I also 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 an independent derivation of a 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.

quant-pharXiv:2512.19819•Dec 24, 2025•8 citations
Born-rule generative modeling, a central task in quantum machine learning, seeks to learn probability distributions that can be efficiently sampled by measuring complex quantum states. One hope is for quantum models to efficiently capture probability distributions that are difficult to learn and simulate by classical means alone. Quantum Boltzmann machines were proposed about one decade ago for this purpose, yet efficient training methods have remained elusive. In this paper, I overcome this obstacle by proposing a practical solution that trains quantum Boltzmann machines for Born-rule generative modeling. Two key ingredients in the proposal are the Donsker-Varadhan variational representation of the classical relative entropy and the quantum Boltzmann gradient estimator of [Patel et al., arXiv:2410.12935]. I present the main result for a more general ansatz known as an evolved quantum Boltzmann machine [Minervini et al., arXiv:2501.03367], which combines parameterized real- and imaginary-time evolution. I also show how to extend the findings to other distinguishability measures beyond relative entropy. Finally, I present four different hybrid quantum-classical algorithms for the minimax optimization underlying training, and I discuss their theoretical convergence guarantees.
We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. Given two parameterized Hamiltonians G(θ)G(θ)G(θ) and H(ϕ)H(ϕ)H(ϕ), an evolved quantum Boltzmann machine consists of preparing a thermal state of the first Hamiltonian G(θ)G(θ)G(θ) followed by unitary evolution according to the second Hamiltonian H(ϕ)H(ϕ)H(ϕ). Alternatively, one can think of it as first realizing imaginary time evolution according to G(θ)G(θ)G(θ) followed by real time evolution according to H(ϕ)H(ϕ)H(ϕ). 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.
This chapter develops quantum generative models as a distinct paradigm within quantum machine learning (QML), emphasizing distribution learning and sampling rather than prediction. It begins by showing how quantum states naturally define probability distributions through the Born rule, thereby making sampling an intrinsic physical process rather than an auxiliary computational step. On this foundation, this chapter presents three principal frameworks: Quantum circuit Born machines (QCBMs), quantum generative adversarial networks (QGANs), and quantum Boltzmann machines (QBMs). QCBMs are introduced as the most direct and conceptually transparent generative models based on parameterized quantum circuits; QGANs extend adversarial learning into the quantum domain through generator–discriminator competition; and QBMs connect generative modeling to quantum statistical mechanics through Gibbs states and quantum Hamiltonians. This chapter compares these models in terms of expressivity, training stability, and hardware feasibility, highlighting the recurring tension between representational richness and practical trainability. It also examines key application areas, including synthetic data generation, scientific distribution learning, quantum simulation, and hybrid classical-quantum pipelines, while emphasizing major open challenges such as noise, sampling overhead, limited hardware scalability, and the absence of clearly demonstrated quantum advantage. Taken together, this chapter establishes generative modeling as a central pillar of QML.
The combination of quantum and classical computational resources towards more effective algorithms is one of the most promising research directions in computer science. In such a hybrid framework, existing quantum computers can be used to their fullest extent and for practical applications. Generative modeling is one of the applications that could benefit the most, either by speeding up the underlying sampling methods or by unlocking more general models. In this work, we design a number of hybrid generative models and validate them on real hardware and datasets. The quantum-assisted Boltzmann machine is trained to generate realistic artificial images on quantum annealers. Several challenges in state-of-the-art annealers shall be overcome before one can assess their actual performance. We attack some of the most pressing challenges such as the sparse qubit-to-qubit connectivity, the unknown effective-temperature, and the noise on the control parameters. In order to handle datasets of realistic size and complexity, we include latent variables and obtain a more general model called the quantum-assisted Helmholtz machine. In the context of gate-based computers, the quantum circuit Born machine is trained to encode a target probability distribution in the wavefunction of a set of qubits. We implement this model on a trapped ion computer using low-depth circuits and native gates. We use the generative modeling performance on the canonical Bars-and-Stripes dataset to design a benchmark for hybrid systems. It is reasonable to expect that quantum data, i.e., datasets of wavefunctions, will become available in the future. We derive a quantum generative adversarial network that works with quantum data. Here, two circuits are optimized in tandem: one tries to generate suitable quantum states, the other tries to distinguish between target and generated states.
Estimating the ground-state energy of Hamiltonians is a fundamental task for which it is believed that quantum computers can be helpful. Several approaches have been proposed toward this goal, including algorithms based on quantum phase estimation and hybrid quantum-classical optimizers involving parameterized quantum circuits, the latter falling under the umbrella of the variational quantum eigensolver. Here, we analyze the performance of quantum Boltzmann machines for this task, which is a less explored ansatz based on parameterized thermal states and which is not known to suffer from the barren-plateau problem. We delineate a hybrid quantum-classical algorithm for this task and rigorously prove that it converges to an ε\varepsilonε-approximate stationary point of the energy function optimized over parameter space, while using a number of parameterized-thermal-state samples that is polynomial in ε−1\varepsilon^{-1}ε−1, the number of parameters, and the norm of the Hamiltonian being optimized. Our algorithm estimates the gradient of the energy function efficiently by means of a quantum circuit construction that combines classical random sampling, Hamiltonian simulation, and the Hadamard test. Additionally, supporting our main claims are calculations of the gradient and Hessian of the energy function, as well as an upper bound on the matrix elements of the latter that is used in the convergence analysis.
Abstract The quantum Boltzmann machine (QBM) is a generative machine learning model for both classical data and quantum states. Training the QBM consists of minimizing the relative entropy from the model to the target state. This requires QBM expectation values which are computationally intractable for large models in general. It is therefore important to develop heuristic training methods that work well in practice. In this work, we study a heuristic method characterized by a nested loop: the inner loop trains the β-variational quantum eigensolver (β-VQE) by Liu et al (2021 Mach. Learn.: Sci. Technol. 2 025011) to approximate the QBM expectation values; the outer loop trains the QBM to minimize the relative entropy to the target. We show that low-rank representations obtained by β-VQE provide an efficient way to learn low-rank target states, such as classical data and low-temperature quantum tomography. We test the method on both classical and quantum target data with numerical simulations of up to 10 qubits. For the cases considered here, the obtained QBMs can model the target to high fidelity. We implement a trained model on a physical quantum device. The approach offers a valuable route towards variationally training QBMs on near-term quantum devices.
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; I also 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 an independent derivation of a 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.