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:2307.14459 · IEEE International Conference on Quantum Computing and Engineering (QCE)

Training Quantum Boltzmann Machines with Coresets

Joshua Viszlai, Teague Tomesh, Pranav Gokhale, Eric R. Anschuetz, Frederic T. Chong

Published Sep 1, 2022• 1 citation
arXivHTMLPDF

Abstract

Recent work has proposed and explored using coreset techniques for quantum algorithms that operate on classical data sets to accelerate the applicability of these algorithms on near-term quantum devices. We apply these ideas to Quantum Boltzmann Machines (QBM) where gradient-based steps which require Gibbs state sampling are the main computational bottle-neck during training. By using a coreset in place of the full data set, we try to minimize the number of steps needed and accelerate the overall training time. In a regime where computational time on quantum computers is a precious resource, we propose this might lead to substantial practical savings. We evaluate this approach on 6x6 binary images from an augmented bars and stripes data set using a QBM with 36 visible units and 8 hidden units. Using an Inception score inspired metric, we compare QBM training times with and without using coresets.

DOI
10.1109/qce53715.2022.00049

Related papers

On the sample complexity of quantum Boltzmann machine learning

Luuk Coopmans, Marcello Benedetti

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.

arXiv:2306.14969•Communications Physics•Aug 14, 2024•27 citations

Variational quantum Boltzmann machines

Christa Zoufal, Aurélien Lucchi, Stefan Woerner

Abstract 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, a technique that is typically used for ground-state computation. In contrast to existing methods, this implementation facilitates near-term compatible QBM training with gradients of the actual loss function for arbitrary parameterized Hamiltonians which do not necessarily have to be fully visible but may also include hidden units. The variational Gibbs state approximation is demonstrated with numerical simulations and experiments run on real quantum hardware provided by IBM Quantum. Furthermore, we illustrate the application of this variational QBM approach to generative and discriminative learning tasks using numerical simulation.

arXiv:2006.06004•Quantum Machine Intelligence•Feb 22, 2021•99 citations

Quantum Boltzmann Machines Using Parallel Annealing for Medical Image Classification

Daniëlle Schuman, Mark V. Seebode, Tobias Rohe +5 more

Exploiting the fact that samples drawn from a quantum annealer inherently follow a boltzmann-like distribution, annealing-based Quantum Boltzmann Machines (QBMs) have gained increasing popularity in the quantum research community. While they harbor great promises for quantum speed-up, their usage currently stays a costly endeavor, as large amounts of QPU time are required to train them. This limits their applicability in the NISQ era. Following the idea of Noè et al. [1], who tried to alleviate this cost by incorporating parallel quantum annealing into their unsupervised training of QBMs, this paper presents an improved version of parallel quantum annealing that we employ to train QBMs in a supervised setting. Saving qubits to encode the inputs, the latter setting allows us to test our approach on medical images from the MedMNIST data set [2], thereby moving closer to real-world applicability of the technology. Our experiments show that QBMs using our approach already achieve reasonable results, comparable to those of similarly-sized Convolutional Neural Networks (CNNs), with a markedly smaller numbers of epochs than these classical models. Our using parallel annealing grants it a speed-up of almost 70% compared to regular annealing-based BM execution.

arXiv:2507.14116•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•2 citations

Generative training of quantum Boltzmann machines with hidden units

Nathan Wiebe, Leonard Wossnig

In this article we provide a method for fully quantum generative training of quantum Boltzmann machines with both visible and hidden units while using quantum relative entropy as an objective. This is significant because prior methods were not able to do so due to mathematical challenges posed by the gradient evaluation. We present two novel methods for solving this problem. The first proposal addresses it, for a class of restricted quantum Boltzmann machines with mutually commuting Hamiltonians on the hidden units, by using a variational upper bound on the quantum relative entropy. The second one uses high-order divided difference methods and linear-combinations of unitaries to approximate the exact gradient of the relative entropy for a generic quantum Boltzmann machine. Both methods are efficient under the assumption that Gibbs state preparation is efficient and that the Hamiltonian are given by a sparse row-computable matrix.

arXiv:1905.09902•May 23, 2019•26 citations

Quantum Boltzmann machine algorithm with dimension-expanded equivalent Hamiltonian

Tailong Xiao, Dongyun Bai, Jianping Fan B +1 more

Quantum machine learning explores the devising and implementing of quantum software to enable the speedup for a classical machine learning counterpart, which has attracted extensive attention. The quantum Boltzmann machine is a promising quantum machine learning model and can be executed on near-term quantum devices to demonstrate quantum supremacy. We investigate an efficient algorithm for training a quantum Boltzmann machine based on a continuous-time quantum cluster Monte Carlo method realized with a dimension-expanded equivalent Hamiltonian. The proposed algorithm is capable of efficiently training various types of quantum Boltzmann machines, including a two-dimensional random transverse Ising Hamiltonian and other stochastic $\ensuremath{\kappa}$-local $(\ensuremath{\kappa}\ensuremath{\ge}2)$ Hamiltonians. We further apply a quantum mean-field method to speed up the training process through discarding the quantum fluctuations of visible-hidden interactions. The experiment results show that our algorithm-trained quantum Boltzmann machine is more efficient on a small and large data set in terms of network convergence and time complexity.

Physical Review A•Mar 5, 2020•13 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•8 citations
Recent work has proposed and explored using coreset techniques for quantum algorithms that operate on classical data sets to accelerate the applicability of these algorithms on near-term quantum devices. We apply these ideas to Quantum Boltzmann Machines (QBM) where gradient-based steps which require Gibbs state sampling are the main computational bottle-neck during training. By using a coreset in place of the full data set, we try to minimize the number of steps needed and accelerate the overall training time. In a regime where computational time on quantum computers is a precious resource, we propose this might lead to substantial practical savings. We evaluate this approach on 6x6 binary images from an augmented bars and stripes data set using a QBM with 36 visible units and 8 hidden units. Using an Inception score inspired metric, we compare QBM training times with and without using coresets.
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.
Abstract 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, a technique that is typically used for ground-state computation. In contrast to existing methods, this implementation facilitates near-term compatible QBM training with gradients of the actual loss function for arbitrary parameterized Hamiltonians which do not necessarily have to be fully visible but may also include hidden units. The variational Gibbs state approximation is demonstrated with numerical simulations and experiments run on real quantum hardware provided by IBM Quantum. Furthermore, we illustrate the application of this variational QBM approach to generative and discriminative learning tasks using numerical simulation.
Exploiting the fact that samples drawn from a quantum annealer inherently follow a boltzmann-like distribution, annealing-based Quantum Boltzmann Machines (QBMs) have gained increasing popularity in the quantum research community. While they harbor great promises for quantum speed-up, their usage currently stays a costly endeavor, as large amounts of QPU time are required to train them. This limits their applicability in the NISQ era. Following the idea of Noè et al. [1], who tried to alleviate this cost by incorporating parallel quantum annealing into their unsupervised training of QBMs, this paper presents an improved version of parallel quantum annealing that we employ to train QBMs in a supervised setting. Saving qubits to encode the inputs, the latter setting allows us to test our approach on medical images from the MedMNIST data set [2], thereby moving closer to real-world applicability of the technology. Our experiments show that QBMs using our approach already achieve reasonable results, comparable to those of similarly-sized Convolutional Neural Networks (CNNs), with a markedly smaller numbers of epochs than these classical models. Our using parallel annealing grants it a speed-up of almost 70% compared to regular annealing-based BM execution.
In this article we provide a method for fully quantum generative training of quantum Boltzmann machines with both visible and hidden units while using quantum relative entropy as an objective. This is significant because prior methods were not able to do so due to mathematical challenges posed by the gradient evaluation. We present two novel methods for solving this problem. The first proposal addresses it, for a class of restricted quantum Boltzmann machines with mutually commuting Hamiltonians on the hidden units, by using a variational upper bound on the quantum relative entropy. The second one uses high-order divided difference methods and linear-combinations of unitaries to approximate the exact gradient of the relative entropy for a generic quantum Boltzmann machine. Both methods are efficient under the assumption that Gibbs state preparation is efficient and that the Hamiltonian are given by a sparse row-computable matrix.
Quantum machine learning explores the devising and implementing of quantum software to enable the speedup for a classical machine learning counterpart, which has attracted extensive attention. The quantum Boltzmann machine is a promising quantum machine learning model and can be executed on near-term quantum devices to demonstrate quantum supremacy. We investigate an efficient algorithm for training a quantum Boltzmann machine based on a continuous-time quantum cluster Monte Carlo method realized with a dimension-expanded equivalent Hamiltonian. The proposed algorithm is capable of efficiently training various types of quantum Boltzmann machines, including a two-dimensional random transverse Ising Hamiltonian and other stochastic $\ensuremath{\kappa}$-local $(\ensuremath{\kappa}\ensuremath{\ge}2)$ Hamiltonians. We further apply a quantum mean-field method to speed up the training process through discarding the quantum fluctuations of visible-hidden interactions. The experiment results show that our algorithm-trained quantum Boltzmann machine is more efficient on a small and large data set in terms of network convergence and time complexity.
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.