Score: 0

Quantum Boltzmann Machines for Sample-Efficient Reinforcement Learning

Published: November 6, 2025 | arXiv ID: 2511.04856v1

By: Thore Gerlach, Michael Schenk, Verena Kain

Potential Business Impact:

Makes computers learn faster with less effort.

Business Areas:
Quantum Computing Science and Engineering

We introduce theoretically grounded Continuous Semi-Quantum Boltzmann Machines (CSQBMs) that supports continuous-action reinforcement learning. By combining exponential-family priors over visible units with quantum Boltzmann distributions over hidden units, CSQBMs yield a hybrid quantum-classical model that reduces qubit requirements while retaining strong expressiveness. Crucially, gradients with respect to continuous variables can be computed analytically, enabling direct integration into Actor-Critic algorithms. Building on this, we propose a continuous Q-learning framework that replaces global maximization by efficient sampling from the CSQBM distribution, thereby overcoming instability issues in continuous control.

Country of Origin
🇩🇪 Germany

Page Count
8 pages

Category
Computer Science:
Machine Learning (CS)