Reinforcement Learning Using Quantum Boltzmann Machines

Abstract

We investigate whether quantum annealers with select chip layouts can outperform classical computers in reinforcement learning tasks. We associate a transverse field Ising spin Hamiltonian with a layout of qubits similar to that of a deep Boltzmann machine (DBM) and use simulated quantum annealing (SQA) to numerically simulate quantum sampling from this system. We design a reinforcement learning algorithm in which the set of visible nodes representing the states and actions of an optimal policy are the first and last layers of the deep network. In absence of a transverse field, our simulations show that DBMs are trained more effectively than restricted Boltzmann machines (RBM) with the same number of nodes. We then develop a framework for training the network as a quantum Boltzmann machine (QBM) in the presence of a significant transverse field for reinforcement learning. This method also outperforms the reinforcement learning method that uses RBMs.

Cited by in corpus (6)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
• Kernel methods for interpretable machine learning of order parameters
• Clustering of conditional mutual information for quantum Gibbs states above a threshold temperature
• Partitioning Dense Graphs with Hardware Accelerators
• Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly