Generative modeling using evolved quantum Boltzmann machines
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 53 references that are in the map. First posted on arXiv 2 Dec 2025.
Builds on
27 of 53 references.
References · 27
- 2020Variational Quantum Algorithmscited by 692
- 2018MINE: Mutual Information Neural Estimationcited by 683
- 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 506
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 270
- 2023Handbook of Convergence Theorems for (Stochastic) Gradient Methodscited by 163
- 2018Differentiable Learning of Quantum Circuit Born Machinecited by 93
- 2019The Born Supremacy: Quantum Advantage and Training of an Ising Born Machinecited by 76
- 2020On the Quantum versus Classical Learnability of Discrete Distributionscited by 57
- 2021Enhancing Generative Models via Quantum Correlationscited by 41
- 2021Extragradient Method: O(1/K) Last-Iterate Convergence for Monotone Variational Inequalities and Connections With Cocoercivitycited by 39
- 2023Trainability barriers and opportunities in quantum generative modelingcited by 36
- 2019On Solving Minimax Optimization Locally: A Follow-the-Ridge Approachcited by 34
15 more
- 2023Towards provably efficient quantum algorithms for large-scale machine-learning modelscited by 32
- 2024A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerancecited by 32
- 2016Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Modelscited by 26
- 2021Neural Estimation of Statistical Divergencescited by 25
- 2023On the Sample Complexity of Quantum Boltzmann Machine Learningcited by 19
- 2024Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimizationcited by 16
- 2019Generative training of quantum Boltzmann machines with hidden unitscited by 14
- 2024Quantum Boltzmann machine learning of ground-state energiescited by 12
- 2025A Primer on Quantum Machine Learningcited by 12
- 2023Information-theoretic generalization bounds for learning from quantum datacited by 9
- 2024Natural gradient and parameter estimation for quantum Boltzmann machinescited by 9
- 2021Estimating distinguishability measures on quantum computerscited by 3
- 2025Performance Guarantees for Quantum Neural Estimation of Entropiescited by 3
- 2025Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systemscited by 2
- 2022HessianFR: An Efficient Hessian-based Follow-the-Ridge Algorithm for Minimax Optimizationcited by 1
Built on by
Not cited yet.