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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum-Assisted Machine Learning Framework: Training and Evaluation of Boltzmann Machines Using Quantum Annealers

Jose P. Pinilla, Steven J. E. Wilton

Published Sep 15, 2024• 1 citation
Publisher

Abstract

This paper describes the components and configurations available in a new quantum-assisted machine learning (QAML) framework. QAML is an open source package that provides a new and flexible test-bed for algorithms to train and evaluate Boltzmann machines (BMs) using quantum annealers. Quantum annealing processors enable the training capabilities for both restricted (RBM) and general Boltzmann machines (BM). These methods rely on the fidelity of samples from those devices, which approximate the characteristic Boltzmann distribution of the BM models. The models and optimization functions are built on top of the PyTorch and D-Wave Ocean libraries. The goal of this paper is to introduce developers and researchers to a familiar, yet flexible, software development framework, to explore the use of quantum computing in machine learning applications. The framework is open-source and has been made publicly available.

DOI
10.1109/qce60285.2024.00197

Related papers

Structural Modifications in Quantum-Assisted Training for General Boltzmann Machines

Jose P. Pinilla, Steven J. E. Wilton

Quantum-assisted training of machine learning models makes use of the sampling capabilities of quantum computing devices to approximate the probability distribution of classical generative machine learning models. One example of this is the use of quantum annealers to sample from a Boltzmann distribution to assist the computation of gradients required to train Boltzmann machines (BMs). Doing so requires the interactions and weights of a BM to be mapped onto the underlying qubit connectivity built into the quantum device hardware. This opens the possibility of formulating any graph topology as a BM, instead of the more common classical approach of restricting their connectivity; i.e., Restricted Boltz-mann Machine (RBM). This work is focused on simultaneous modifications of the connectivity and qubit mapping of general BMs, which we refer to as structure-aware minor-embedding. We show how minor-embedding can be performed taking into account the nature of the BM. We also evaluate weight “pruning”, which is motivated by the intuition that, when a QAML model is pruned, the resulting qubit chains resulting from the minor-embedding methods can provide better quality samples, at the expense of a smaller model.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

Quantum adiabatic machine learning by zooming into a region of the energy surface

Alexander Zlokapa, A. Mott, Joshua Job +3 more

Recent work has shown that quantum annealing for machine learning, referred to as QAML, can perform comparably to state-of-the-art machine learning methods with a specific application to Higgs boson classification. We propose QAML-Z, an algorithm that iteratively zooms in on a region of the energy surface by mapping the problem to a continuous space and sequentially applying quantum annealing to an augmented set of weak classifiers. Results on a programmable quantum annealer show that QAML-Z matches classical deep neural network performance at small training set sizes and reduces the performance margin between QAML and classical deep neural networks by almost 50% at large training set sizes, as measured by area under the receiver operating characteristic curve. The significant improvement of quantum annealing algorithms for machine learning and the use of a discrete quantum algorithm on a continuous optimization problem both opens a class of problems that can be solved by quantum annealers and suggests the approach in performance of near-term quantum machine learning towards classical benchmarks.

arXiv:1908.04480•Physical Review A•Dec 4, 2020•28 citations

Performance of Quantum Annealing Machine Learning Classification Models on ADMET Datasets

Hadi Salloum, Kamil Sabbagh, Vladislav Savchuk +4 more

The Quantum Annealer built by D-Wave, known as Advantage, is currently the largest quantum computer in the world, featuring a topology called “Pegasus.” This groundbreaking system opens new possibilities for solving highly complex problems. The advancement of quantum annealers has spurred experimental demonstrations and intensified research interest, particularly in quantum machine learning. However, the application of quantum annealing in machine learning remains limited due to the lack of conclusive performance evaluations on real-world datasets. There is still no clear consensus on the efficacy of these models in practical scenarios. This work focuses on experimentally evaluating quantum annealing machine learning (QAML) classification methods, specifically Quantum Support Vector Machines (QSVM) and QBoost, on ADMET datasets—one of the most important datasets in the drug discovery domain. We compare QAML with classical machine learning to evaluate their relative performance. This study seeks to address this gap by rigorously comparing the performance of QBoost and QSVM models using ADMET datasets, employing D-Wave’s Quantum Annealer. This work provides a comprehensive analysis of the potential and limitations of quantum annealers in quantum machine learning, with a focus on their application to real-world data in the ADMET domain. The findings offer critical insights into the nuanced advantages and challenges of quantum annealers in advancing machine learning methodologies.

IEEE Access•Jan 1, 2025•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

Quantum-Assisted Machine Learning by Means of Adiabatic Quantum Computing

Leonardo Tomazeli Duarte, Yannick Deville

Motivated by the potential performance gains offered by quantum computing (QC), a recent research focus — known as quantum-assisted machine learning (QAML) — aims to develop machine learning algorithms tailored for execution on quantum computers while processing data that originate from a classical (i.e. non-quantum) phenomenon. QAML has been studied in various quantum computing (QC) paradigms. This paper, in particular, offers a brief overview of QAML within the context of adiabatic quantum computing (AQC). The major challenge in this case is to reformulate the machine learning task as a quadratic unconstrained binary optimization (QUBO) problem, which lies at the core of existing AQC physical implementations. We provide examples of machine learning techniques tailored to AQC, along with applications in remote sensing.

IEEE Mediterranean and Middle-East Geoscience and Remote Sensing Symposium (M2GARSS)•Apr 15, 2024•5 citations

Bayesian machine learning for Boltzmann machine in quantum-enhanced feature spaces

Yusen Wu, Chao‐Hua Yu, Su‐Juan Qin +2 more

Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we develop a quantum bayesian learning framework of the restricted Boltzmann machine in the quantum-enhanced feature spaces. Our framework provides the encoding phase to map the real data and Boltzmann weight onto the quantum feature spaces and the training phase to learn an optimal inference function. Specifically, the training phase provides a physical quantity to measure the posterior distribution in quantum feature spaces, and this measure is utilized to design the quantum maximum a posterior (QMAP) algorithm and the quantum predictive distribution estimator (QPDE). It is shown that both quantum algorithms achieve exponential speed-up over their classical counterparts. Furthermore, it is interesting to note that our framework can figure out the classical bayesian learning tasks, i.e. processing the classical data and outputting corresponding classical labels. And a simulation, which is performed on an open-source software framework for quantum computing, illustrates that our algorithms show almost the same classification performance compared to their classical counterparts. Noting that the proposed quantum algorithms utilize the shallow circuit, our work is expected to be implemented on the noisy intermediate-scale quantum (NISQ) devices, and is one of the promising candidates to achieve quantum supremacy.

arXiv:1912.10857•Dec 20, 2019•5 citations
This paper describes the components and configurations available in a new quantum-assisted machine learning (QAML) framework. QAML is an open source package that provides a new and flexible test-bed for algorithms to train and evaluate Boltzmann machines (BMs) using quantum annealers. Quantum annealing processors enable the training capabilities for both restricted (RBM) and general Boltzmann machines (BM). These methods rely on the fidelity of samples from those devices, which approximate the characteristic Boltzmann distribution of the BM models. The models and optimization functions are built on top of the PyTorch and D-Wave Ocean libraries. The goal of this paper is to introduce developers and researchers to a familiar, yet flexible, software development framework, to explore the use of quantum computing in machine learning applications. The framework is open-source and has been made publicly available.
Quantum-assisted training of machine learning models makes use of the sampling capabilities of quantum computing devices to approximate the probability distribution of classical generative machine learning models. One example of this is the use of quantum annealers to sample from a Boltzmann distribution to assist the computation of gradients required to train Boltzmann machines (BMs). Doing so requires the interactions and weights of a BM to be mapped onto the underlying qubit connectivity built into the quantum device hardware. This opens the possibility of formulating any graph topology as a BM, instead of the more common classical approach of restricting their connectivity; i.e., Restricted Boltz-mann Machine (RBM). This work is focused on simultaneous modifications of the connectivity and qubit mapping of general BMs, which we refer to as structure-aware minor-embedding. We show how minor-embedding can be performed taking into account the nature of the BM. We also evaluate weight “pruning”, which is motivated by the intuition that, when a QAML model is pruned, the resulting qubit chains resulting from the minor-embedding methods can provide better quality samples, at the expense of a smaller model.
Recent work has shown that quantum annealing for machine learning, referred to as QAML, can perform comparably to state-of-the-art machine learning methods with a specific application to Higgs boson classification. We propose QAML-Z, an algorithm that iteratively zooms in on a region of the energy surface by mapping the problem to a continuous space and sequentially applying quantum annealing to an augmented set of weak classifiers. Results on a programmable quantum annealer show that QAML-Z matches classical deep neural network performance at small training set sizes and reduces the performance margin between QAML and classical deep neural networks by almost 50% at large training set sizes, as measured by area under the receiver operating characteristic curve. The significant improvement of quantum annealing algorithms for machine learning and the use of a discrete quantum algorithm on a continuous optimization problem both opens a class of problems that can be solved by quantum annealers and suggests the approach in performance of near-term quantum machine learning towards classical benchmarks.
The Quantum Annealer built by D-Wave, known as Advantage, is currently the largest quantum computer in the world, featuring a topology called “Pegasus.” This groundbreaking system opens new possibilities for solving highly complex problems. The advancement of quantum annealers has spurred experimental demonstrations and intensified research interest, particularly in quantum machine learning. However, the application of quantum annealing in machine learning remains limited due to the lack of conclusive performance evaluations on real-world datasets. There is still no clear consensus on the efficacy of these models in practical scenarios. This work focuses on experimentally evaluating quantum annealing machine learning (QAML) classification methods, specifically Quantum Support Vector Machines (QSVM) and QBoost, on ADMET datasets—one of the most important datasets in the drug discovery domain. We compare QAML with classical machine learning to evaluate their relative performance. This study seeks to address this gap by rigorously comparing the performance of QBoost and QSVM models using ADMET datasets, employing D-Wave’s Quantum Annealer. This work provides a comprehensive analysis of the potential and limitations of quantum annealers in quantum machine learning, with a focus on their application to real-world data in the ADMET domain. The findings offer critical insights into the nuanced advantages and challenges of quantum annealers in advancing machine learning methodologies.
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.
Motivated by the potential performance gains offered by quantum computing (QC), a recent research focus — known as quantum-assisted machine learning (QAML) — aims to develop machine learning algorithms tailored for execution on quantum computers while processing data that originate from a classical (i.e. non-quantum) phenomenon. QAML has been studied in various quantum computing (QC) paradigms. This paper, in particular, offers a brief overview of QAML within the context of adiabatic quantum computing (AQC). The major challenge in this case is to reformulate the machine learning task as a quadratic unconstrained binary optimization (QUBO) problem, which lies at the core of existing AQC physical implementations. We provide examples of machine learning techniques tailored to AQC, along with applications in remote sensing.
Bayesian learning is ubiquitous for implementing classification and regression tasks, however, it is accompanied by computationally intractable limitations when the feature spaces become extremely large. Aiming to solve this problem, we develop a quantum bayesian learning framework of the restricted Boltzmann machine in the quantum-enhanced feature spaces. Our framework provides the encoding phase to map the real data and Boltzmann weight onto the quantum feature spaces and the training phase to learn an optimal inference function. Specifically, the training phase provides a physical quantity to measure the posterior distribution in quantum feature spaces, and this measure is utilized to design the quantum maximum a posterior (QMAP) algorithm and the quantum predictive distribution estimator (QPDE). It is shown that both quantum algorithms achieve exponential speed-up over their classical counterparts. Furthermore, it is interesting to note that our framework can figure out the classical bayesian learning tasks, i.e. processing the classical data and outputting corresponding classical labels. And a simulation, which is performed on an open-source software framework for quantum computing, illustrates that our algorithms show almost the same classification performance compared to their classical counterparts. Noting that the proposed quantum algorithms utilize the shallow circuit, our work is expected to be implemented on the noisy intermediate-scale quantum (NISQ) devices, and is one of the promising candidates to achieve quantum supremacy.