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:2304.12418 · Quantum Machine Intelligence

A hybrid quantum-classical approach for inference on restricted Boltzmann machines

Mārtiņš Kālis, Andris Locāns, Rolands Šikovs, Hassan Naseri, Andris Ambainis

Published Nov 21, 2023• 12 citations
arXivHTMLPDF
DOI
10.1007/s42484-023-00135-y

Related papers

Restricted Boltzmann machines in quantum physics

Roger G. Melko, Giuseppe Carleo, Juan Carrasquilla +1 more

Nature Physics•Jun 24, 2019•216 citations

Quantum Discriminative Restricted Boltzmann Machine

Kouki Yonaga, Masayuki Ohzeki

Journal of the Physical Society of Japan•Apr 24, 2025•2 citations

A Hybrid Quantum-Classical Algorithm for Training Quantum Boltzmann Machines

Christa Zoufal, Aurélien Lucchi, Stefan Woerner

Bulletin of the American Physical Society•Mar 2, 2020•0 citations

Learning Restricted Boltzmann Machines with greedy quantum search

Liming Zhao, Agrawal, Aman, Patrick Rebentrost

Restricted Boltzmann Machines (RBMs) are widely used probabilistic undirected graphical models with visible and latent nodes, playing an important role in statistics and machine learning. The task of structure learning for RBMs involves inferring the underlying graph by using samples from the visible nodes. Specifically, learning the two-hop neighbors of each visible node allows for the inference of the graph structure. Prior research has addressed the structure learning problem for specific classes of RBMs, namely ferromagnetic and locally consistent RBMs. In this paper, we extend the scope to the quantum computing domain and propose corresponding quantum algorithms for this problem. Our study demonstrates that the proposed quantum algorithms yield a polynomial speedup compared to the classical algorithms for learning the structure of these two classes of RBMs.

arXiv:2309.14196•Sep 25, 2023•0 citations

RBM Image Generation Using the D-Wave 2000Q

Jennifer Sleeman, Milton Halem, John E. Dorband

We describe a hybrid approach that combines a deep convolutional neural network autoencoder and a quantum Restricted Boltzmann Machine (RBM) for image generation using the D-Wave 2000Q. We compare the quantum learned distribution with the classical learned distribution, and quantify the quantum effects on latent representations.

•Oct 30, 2019•1 citation

On the Challenges of Physical Implementations of RBMs

Vincent Dumoulin, Ian Goodfellow, Aaron C. Courville +1 more

Restricted Boltzmann machines (RBMs) are powerful machine learning models, but learning and some kinds of inference in the model require sampling-based approximations, which, in classical digital computers, are implemented using expensive MCMC. Physical computation offers the opportunity to reduce the cost of sampling by building physical systems whose natural dynamics correspond to drawing samples from the desired RBM distribution. Such a system avoids the burn-in and mixing cost of a Markov chain. However, hardware implementations of this variety usually entail limitations such as low-precision and limited range of the parameters and restrictions on the size and topology of the RBM. We conduct software simulations to determine how harmful each of these restrictions is. Our simulations are designed to reproduce aspects of the D-Wave quantum computer, but the issues we investigate arise in most forms of physical computation.

arXiv:1312.5258•National Conference on Artificial Intelligence•Dec 18, 2013•37 citations
Restricted Boltzmann Machines (RBMs) are widely used probabilistic undirected graphical models with visible and latent nodes, playing an important role in statistics and machine learning. The task of structure learning for RBMs involves inferring the underlying graph by using samples from the visible nodes. Specifically, learning the two-hop neighbors of each visible node allows for the inference of the graph structure. Prior research has addressed the structure learning problem for specific classes of RBMs, namely ferromagnetic and locally consistent RBMs. In this paper, we extend the scope to the quantum computing domain and propose corresponding quantum algorithms for this problem. Our study demonstrates that the proposed quantum algorithms yield a polynomial speedup compared to the classical algorithms for learning the structure of these two classes of RBMs.
Restricted Boltzmann machines (RBMs) are powerful machine learning models, but learning and some kinds of inference in the model require sampling-based approximations, which, in classical digital computers, are implemented using expensive MCMC. Physical computation offers the opportunity to reduce the cost of sampling by building physical systems whose natural dynamics correspond to drawing samples from the desired RBM distribution. Such a system avoids the burn-in and mixing cost of a Markov chain. However, hardware implementations of this variety usually entail limitations such as low-precision and limited range of the parameters and restrictions on the size and topology of the RBM. We conduct software simulations to determine how harmful each of these restrictions is. Our simulations are designed to reproduce aspects of the D-Wave quantum computer, but the issues we investigate arise in most forms of physical computation.