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:2003.11945 · Advanced Quantum Technologies

Quantum Semantic Learning by Reverse Annealing of an Adiabatic Quantum Computer

Lorenzo Rocutto, C. Destri, Enrico Prati

Published Dec 14, 2020• 48 citations
arXivHTMLPDF

Abstract

Abstract Restricted Boltzmann machines (RBMs) constitute a class of neural networks for unsupervised learning with applications ranging from pattern classification to quantum state reconstruction. Despite the potential representative power, the diffusion of RBMs is quite limited since their training process proves to be hard. The advent of commercial adiabatic quantum computers (AQCs) raised the expectation that the implementations of RBMs on such quantum devices can increase the training speed with respect to conventional hardware. Here, the feasibility of a complete RBM on AQCs is demonstrated, thanks to an embedding that associates the nodes of the neural networks to virtual qubits. A semantic quantum search is implemented thanks to a reverse annealing schedule. Such an approach exploits more information from the training data, mimicking the behavior of the classical Gibbs sampling algorithm. The semantic training is shown to quickly raise the sampling probability of a subset of the set of the configurations. Even without a proper optimization of the annealing schedule, the RBM semantically trained achieves good scores on reconstruction tasks. The development of such techniques paves the way toward the establishment of a quantum advantage of adiabatic quantum computers, especially given the foreseen improvement of such hardware.

DOI
10.1002/qute.202000133

Related papers

A complete restricted Boltzmann machine on an adiabatic quantum computer

Lorenzo Rocutto, Enrico Prati

Boltzmann Machines constitute a paramount class of neural networks for unsupervised learning and recommendation systems. Their bipartite version, called Restricted Boltzmann Machine (RBM), is the most developed because of its satisfactory trade-off between computability on classical computers and computational power. Though the diffusion of RBMs is quite limited as their training remains hard. Recently, a renewed interest has emerged as Adiabatic Quantum Computers (AQCs), which suggest a potential increase of the training speed with respect to conventional hardware. Due to the limited number of connections among the qubits forming the graph of existing hardware, associating one qubit per node of the neural network implies an incomplete graph. Thanks to embedding techniques, we developed a complete graph connecting nodes constituted by virtual qubits. The complete graph outperforms previous implementations based on incomplete graphs. Despite the fact that the learning rate per epoch is still slower with respect to a classical machine, the advantage is expected by the increase of number of nodes which impacts on the classical computational time but not on the quantum hardware based computation.

International Journal of Quantum Information•Jun 1, 2021•13 citations

Anomaly detection speed-up by quantum restricted Boltzmann machines

Lorenzo Moro, Enrico Prati

Abstract Quantum machine learning promises to revolutionize traditional machine learning by efficiently addressing hard tasks for classical computation. While claims of quantum speed-up have been announced for gate-based quantum computers and photon-based boson samplers, demonstration of an advantage by adiabatic quantum annealers (AQAs) is open. Here we quantify the computational cost and the performance of restricted Boltzmann machines (RBMs), a widely investigated machine learning model, by classical and quantum annealing. Despite the lower computational complexity of the quantum RBM being lost due to physical implementation overheads, a quantum speed-up may arise as a reduction by orders of magnitude of the computational time. By employing real-world cybersecurity datasets, we observe that the negative phase on sufficiently challenging tasks is computed up to 64 times faster by AQAs during the exploitation phase. Therefore, although a quantum speed-up highly depends on the problem’s characteristics, it emerges in existing hardware on real-world data.

Communications Physics•Sep 23, 2023•28 citations

Quantum Parallel Training of a Boltzmann Machine on an Adiabatic Quantum Computer

Davide Noè, Lorenzo Rocutto, Lorenzo Del Moro +1 more

Abstract Despite the anticipated speed‐up of quantum computing, the achievement of a measurable advantage remains subject to ongoing debate. Adiabatic Quantum Computers (AQCs) are quantum devices designed to solve quadratic uncostrained binary optimization (QUBO) problems, but their intrinsic thermal noise can be leveraged to train computationally demanding machine learning algorithms such as the Boltzmann Machine (BM). Despite an asymptotic advantage is expected only for large networks, a limited quantum speed up can be already achieved on a small BM is shown, by exploiting parallel adiabatic computation. This approach exhibits a 8.6‐fold improvement in wall time on the Bars and Stripes dataset when compared to a parallelized classical Gibbs sampling method, which has never been outperformed before by quantum approaches.

Advanced Quantum Technologies•Apr 29, 2024•11 citations

Software techniques for training restricted Boltzmann machines on size-constrained quantum annealing hardware

Ilmo Salmenperä, Jukka K. Nurminen

Restricted Boltzmann machines are common machine learning models that can utilize quantum annealing devices in their training processes as quantum samplers. While this approach has shown promise as an alternative to classical sampling methods, the limitations of quantum annealing hardware, such as the number of qubits and the lack of connectivity between the qubits, still pose a barrier to wide-scale adoption. We propose the use of multiple software techniques such as dropout method, passive labeling, and parallelization techniques for addressing these hardware limitations. The study found that using these techniques along with quantum sampling showed comparable results to its classical counterparts in certain contexts, while in others the increased complexity of the sampling process hindered the performance of the trained models. This means that further research into the behavior of quantum sampling needs to be done to apply quantum annealing to training tasks of more complicated RBM models.

Frontiers in Computer Science•Oct 16, 2023•3 citations

Sparks of Quantum Advantage and Rapid Retraining in Machine Learning

William C. Troy

The advent of quantum computing holds the potential to revolutionize various fields by solving complex problems more efficiently than classical computers. Despite this promise, practical quantum advantage is hindered by current hardware limitations, notably the small number of qubits and high noise levels. In this study, we leverage adiabatic quantum computers to optimize Kolmogorov-Arnold Networks, a powerful neural network architecture for representing complex functions with minimal parameters. By modifying the network to use Bezier curves as the basis functions and formulating the optimization problem into a Quadratic Unconstrained Binary Optimization problem, we create a fixed-sized solution space, independent of the number of training samples. This strategy allows for the optimization of an entire neural network in a single training iteration in which, due to order of operations, a majority of the processing is done using a collapsed version of the training dataset. This inherently creates extremely fast training speeds, which are validated experimentally, compared to classical optimizers including Adam, Stochastic Gradient Descent, Adaptive Gradient, and simulated annealing. Additionally, we introduce a novel rapid retraining capability, enabling the network to be retrained with new data without reprocessing old samples, thus enhancing learning efficiency in dynamic environments. Experiments on retraining demonstrate a hundred times speed up using adiabatic quantum computing based optimization compared to that of the gradient descent based optimizers, with theoretical models allowing this speed up to be much larger! Our findings suggest that with further advancements in quantum hardware and algorithm optimization, quantum-optimized machine learning models could have broad applications across various domains, with initial focus on rapid retraining.

arXiv:2407.16020•Jul 22, 2024•7 citations

Diabatic quantum annealing for training energy-based generative models

Gilhan Kim, Ju-Yeon Gyhm, Daniel K. Park

Energy-based generative models, such as restricted Boltzmann machines (RBMs), require unbiased Boltzmann samples for effective training. Classical Markov chain Monte Carlo methods, however, converge slowly and yield correlated samples, making large-scale training difficult. We address this bottleneck by applying the analytic relation between annealing schedules and effective inverse temperature in diabatic quantum annealing. By implementing this prescription on a quantum annealer, we obtain temperature-controlled Boltzmann samples that enable RBM training with faster convergence and lower validation error than classical sampling. We further identify a systematic temperature misalignment intrinsic to analog quantum computers and propose an analytical rescaling method that mitigates this hardware noise, thereby enhancing the practicality of quantum annealers as Boltzmann samplers. In our method, the model's connectivity is set directly by the qubit connectivity, transforming the computational complexity inherent in classical sampling into a requirement on quantum hardware. This shift allows the approach to extend naturally from RBMs to fully connected Boltzmann machines, opening opportunities inaccessible to classical training methods.

arXiv:2509.09374•Physical review. E•Feb 6, 2026•3 citations
Abstract Restricted Boltzmann machines (RBMs) constitute a class of neural networks for unsupervised learning with applications ranging from pattern classification to quantum state reconstruction. Despite the potential representative power, the diffusion of RBMs is quite limited since their training process proves to be hard. The advent of commercial adiabatic quantum computers (AQCs) raised the expectation that the implementations of RBMs on such quantum devices can increase the training speed with respect to conventional hardware. Here, the feasibility of a complete RBM on AQCs is demonstrated, thanks to an embedding that associates the nodes of the neural networks to virtual qubits. A semantic quantum search is implemented thanks to a reverse annealing schedule. Such an approach exploits more information from the training data, mimicking the behavior of the classical Gibbs sampling algorithm. The semantic training is shown to quickly raise the sampling probability of a subset of the set of the configurations. Even without a proper optimization of the annealing schedule, the RBM semantically trained achieves good scores on reconstruction tasks. The development of such techniques paves the way toward the establishment of a quantum advantage of adiabatic quantum computers, especially given the foreseen improvement of such hardware.
Boltzmann Machines constitute a paramount class of neural networks for unsupervised learning and recommendation systems. Their bipartite version, called Restricted Boltzmann Machine (RBM), is the most developed because of its satisfactory trade-off between computability on classical computers and computational power. Though the diffusion of RBMs is quite limited as their training remains hard. Recently, a renewed interest has emerged as Adiabatic Quantum Computers (AQCs), which suggest a potential increase of the training speed with respect to conventional hardware. Due to the limited number of connections among the qubits forming the graph of existing hardware, associating one qubit per node of the neural network implies an incomplete graph. Thanks to embedding techniques, we developed a complete graph connecting nodes constituted by virtual qubits. The complete graph outperforms previous implementations based on incomplete graphs. Despite the fact that the learning rate per epoch is still slower with respect to a classical machine, the advantage is expected by the increase of number of nodes which impacts on the classical computational time but not on the quantum hardware based computation.
Abstract Quantum machine learning promises to revolutionize traditional machine learning by efficiently addressing hard tasks for classical computation. While claims of quantum speed-up have been announced for gate-based quantum computers and photon-based boson samplers, demonstration of an advantage by adiabatic quantum annealers (AQAs) is open. Here we quantify the computational cost and the performance of restricted Boltzmann machines (RBMs), a widely investigated machine learning model, by classical and quantum annealing. Despite the lower computational complexity of the quantum RBM being lost due to physical implementation overheads, a quantum speed-up may arise as a reduction by orders of magnitude of the computational time. By employing real-world cybersecurity datasets, we observe that the negative phase on sufficiently challenging tasks is computed up to 64 times faster by AQAs during the exploitation phase. Therefore, although a quantum speed-up highly depends on the problem’s characteristics, it emerges in existing hardware on real-world data.
Abstract Despite the anticipated speed‐up of quantum computing, the achievement of a measurable advantage remains subject to ongoing debate. Adiabatic Quantum Computers (AQCs) are quantum devices designed to solve quadratic uncostrained binary optimization (QUBO) problems, but their intrinsic thermal noise can be leveraged to train computationally demanding machine learning algorithms such as the Boltzmann Machine (BM). Despite an asymptotic advantage is expected only for large networks, a limited quantum speed up can be already achieved on a small BM is shown, by exploiting parallel adiabatic computation. This approach exhibits a 8.6‐fold improvement in wall time on the Bars and Stripes dataset when compared to a parallelized classical Gibbs sampling method, which has never been outperformed before by quantum approaches.
Restricted Boltzmann machines are common machine learning models that can utilize quantum annealing devices in their training processes as quantum samplers. While this approach has shown promise as an alternative to classical sampling methods, the limitations of quantum annealing hardware, such as the number of qubits and the lack of connectivity between the qubits, still pose a barrier to wide-scale adoption. We propose the use of multiple software techniques such as dropout method, passive labeling, and parallelization techniques for addressing these hardware limitations. The study found that using these techniques along with quantum sampling showed comparable results to its classical counterparts in certain contexts, while in others the increased complexity of the sampling process hindered the performance of the trained models. This means that further research into the behavior of quantum sampling needs to be done to apply quantum annealing to training tasks of more complicated RBM models.
The advent of quantum computing holds the potential to revolutionize various fields by solving complex problems more efficiently than classical computers. Despite this promise, practical quantum advantage is hindered by current hardware limitations, notably the small number of qubits and high noise levels. In this study, we leverage adiabatic quantum computers to optimize Kolmogorov-Arnold Networks, a powerful neural network architecture for representing complex functions with minimal parameters. By modifying the network to use Bezier curves as the basis functions and formulating the optimization problem into a Quadratic Unconstrained Binary Optimization problem, we create a fixed-sized solution space, independent of the number of training samples. This strategy allows for the optimization of an entire neural network in a single training iteration in which, due to order of operations, a majority of the processing is done using a collapsed version of the training dataset. This inherently creates extremely fast training speeds, which are validated experimentally, compared to classical optimizers including Adam, Stochastic Gradient Descent, Adaptive Gradient, and simulated annealing. Additionally, we introduce a novel rapid retraining capability, enabling the network to be retrained with new data without reprocessing old samples, thus enhancing learning efficiency in dynamic environments. Experiments on retraining demonstrate a hundred times speed up using adiabatic quantum computing based optimization compared to that of the gradient descent based optimizers, with theoretical models allowing this speed up to be much larger! Our findings suggest that with further advancements in quantum hardware and algorithm optimization, quantum-optimized machine learning models could have broad applications across various domains, with initial focus on rapid retraining.
Energy-based generative models, such as restricted Boltzmann machines (RBMs), require unbiased Boltzmann samples for effective training. Classical Markov chain Monte Carlo methods, however, converge slowly and yield correlated samples, making large-scale training difficult. We address this bottleneck by applying the analytic relation between annealing schedules and effective inverse temperature in diabatic quantum annealing. By implementing this prescription on a quantum annealer, we obtain temperature-controlled Boltzmann samples that enable RBM training with faster convergence and lower validation error than classical sampling. We further identify a systematic temperature misalignment intrinsic to analog quantum computers and propose an analytical rescaling method that mitigates this hardware noise, thereby enhancing the practicality of quantum annealers as Boltzmann samplers. In our method, the model's connectivity is set directly by the qubit connectivity, transforming the computational complexity inherent in classical sampling into a requirement on quantum hardware. This shift allows the approach to extend naturally from RBMs to fully connected Boltzmann machines, opening opportunities inaccessible to classical training methods.