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:1603.07980

Developing Quantum Annealer Driven Data Discovery

Joseph Stephen Dulny, Michael Kim

Published Mar 25, 2016• 9 citations
arXivHTMLPDF

Abstract

Machine learning applications are limited by computational power. In this paper, we gain novel insights into the application of quantum annealing (QA) to machine learning (ML) through experiments in natural language processing (NLP), seizure prediction, and linear separability testing. These experiments are performed on QA simulators and early-stage commercial QA hardware and compared to an unprecedented number of traditional ML techniques. We extend QBoost, an early implementation of a binary classifier that utilizes a quantum annealer, via resampling and ensembling of predicted probabilities to produce a more robust class estimator. To determine the strengths and weaknesses of this approach, resampled QBoost (RQBoost) is tested across several datasets and compared to QBoost and traditional ML. We show and explain how QBoost in combination with a commercial QA device are unable to perfectly separate binary class data which is linearly separable via logistic regression with shrinkage. We further explore the performance of RQBoost in the space of NLP and seizure prediction and find QA-enabled ML using QBoost and RQBoost is outperformed by traditional techniques. Additionally, we provide a detailed discussion of algorithmic constraints and trade-offs imposed by the use of this QA hardware. Through these experiments, we provide unique insights into the state of quantum ML via boosting and the use of quantum annealing hardware that are valuable to institutions interested in applying QA to problems in ML and beyond.

DOI
10.48550/arxiv.1603.07980

Related papers

Quantum Annealing in Machine Learning: QBoost on D-Wave Quantum Annealer

Hadi Salloum, Ali Salloum, Manuel Mazzara +1 more

Quantum computing (QC) has become a fascinating and popular topic due to its broad range of applications, particularly in machine learning (ML). The intersection of QC and ML is known as Quantum Machine Learning (QML). QML is a field that investigates how QC can enhance ML, making it one of the most exciting areas of research due to the potential of QC in solving complex problems. In this paper, we demonstrate the Quantum Annealing (QA) approach to improving ML in binary classification tasks. We implemented the QBoost algorithm on a few datasets using D-Wave’s quantum computers, specifically the Advantage 1 and Advantage 2 prototypes, incorporating the new feature Fast Anneal.

Procedia Computer Science•Jan 1, 2024•8 citations

Ensembles and QBoost

B. Hariharan, Ratna Kumari Neerukonda, C. G. Anupama +1 more

In this chapter we are going to evaluate quantum models. The combining of numerous quantum systems or algorithms to increase performance and resilience is referred to as an ensemble in quantum evaluation models. QBoost is a quantum machine learning technique that is influenced by traditional boosting approaches. It combines several weak quantum classifiers to form a powerful ensemble. Quantum annealing is a strategy for solving optimization issues that makes use of quantum processes. It entails determining the lowest energy state of a physical system that corresponds to the problem’s goal function. The capacity of quantum annealing algorithms to produce optimal or near-optimal solutions in a tolerable time period is assessed, and their performance is compared to traditional optimization approaches. The performance of binary optimization techniques is measured in terms of discovering optimum or near-optimal solutions. Unconstrained binary optimization algorithms are evaluated by assessing their performance in terms of optimum or near-optimal solution discovery, convergence speed, and scalability. The Ising model is a mathematical model that describes how interacting spins behave in a magnetic substance. The Ising model is frequently used in quantum evaluation models as a framework for articulating optimization issues and translating them onto quantum systems. Quantum evaluation models must be compatible with the quantum computing hardware that is now available. The evaluation takes into account aspects such as the required number of qubits, connection restrictions, noise levels, gate availability, and error correction strategies. It is critical to evaluate how effectively a quantum evaluation model works.

Chapman & Hall/CRC eBooks•Oct 1, 2024•0 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

Machine Learning in the Quantum Era

Sachin Khurana, Manisha J. Nene

Machine Learning (ML) has been extensively utilized in various scientific and engineering domains. But the inherent constraints and computational complexity that arise in classical machine learning are particularly evident when dealing with large-scale, high-dimensional datasets or when attempting to solve intricate optimisation problems. Quantum systems exhibit unconventional patterns that are typically not effectively generated by traditional systems and can also tackle high dimensional and large size datasets efficiently. Therefore, it is believed that quantum computing systems may outperform traditional computing devices in machine learning tasks. Quantum Machine Learning (QML) has emerged as a rapidly developing field that combines the concepts of quantum mechanics and machine learning to solve complex problems across various disciplines. The domain of quantum machine learning investigates the development and execution of quantum software with the potential to facilitate machine learning at a much superior pace compared to traditional computers. However, the major challenges encountered are hardware limitations, noise, and development of quantum algorithms. The objective of this paper is to provide an insight on the foundational principles, essential algorithms, various associated platforms, potential applications and challenges being faced by QML. As data continues to grow in size and complexity, together with the emergence of nonlinear and high-dimensional real-world situations, the computing benefits offered by QML have the potential to facilitate significant advancements in the fields of healthcare, finance, robotics, logistics, communication, and cyber security. This paper presents the basis for future research work related to development of quantum algorithms in the domain of machine learning.

International Conference on Futuristic Technologies (INCOFT)•Nov 24, 2023•5 citations

Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering

Pomeroy, Chloe, Aleksandar Pramov, Karishma Thakrar +1 more

This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.

arXiv:2507.15063•Jul 20, 2025•3 citations

Quantum Computing-Driven Optimization of Machine Learning Algorithms for Embedded Systems

Michał Mańkowski, Bartosz Zwoliński, Arkadiusz Lewandowski +3 more

The development of quantum technologies opens new possibilities for the optimization of machine learning (ML) algorithms. In this contribution, we report on the experimental use of quantum computing for training ML algorithms and models designed to be deployed for inference on embedded systems with limited computational resources. Due to the small size of resource-efficient models for embedded systems, this application of quantum computing provides an excellent opportunity to evaluate a technology that is currently being developed in the noisy intermediate-scale quantum era. We develop an approach based on transforming classical supervised learning problems into a discrete form, enabling their solution using quantum annealing (QA) methods. Three models are presented: a binary XNORNet network, a support vector machine (SVM) with a discrete representation of dual coefficients, and a convolutional neural network. All experiments are performed on the MNIST dataset, using classical optimization methods, simulated annealing, and QA on the D-Wave Advantage system. While classical gradientbased methods maintain superior absolute accuracy (up to 95.97% for SVM), the D-Wave system demonstrates a significant reduction in core optimization time, achieving speedups of up to 15.6× compared to classical optimization on a central processing unit when the system overhead is excluded. Preliminary results suggest that while QA entails a slight accuracy and memory requirements penalty, a drastic reduction in active annealing duration serves as a promising strategy to reduce training latency in future embedded-focused ML applications.

International Conference on Methods and Models in Automation and Robotics•Aug 1, 2026•0 citations
Machine learning applications are limited by computational power. In this paper, we gain novel insights into the application of quantum annealing (QA) to machine learning (ML) through experiments in natural language processing (NLP), seizure prediction, and linear separability testing. These experiments are performed on QA simulators and early-stage commercial QA hardware and compared to an unprecedented number of traditional ML techniques. We extend QBoost, an early implementation of a binary classifier that utilizes a quantum annealer, via resampling and ensembling of predicted probabilities to produce a more robust class estimator. To determine the strengths and weaknesses of this approach, resampled QBoost (RQBoost) is tested across several datasets and compared to QBoost and traditional ML. We show and explain how QBoost in combination with a commercial QA device are unable to perfectly separate binary class data which is linearly separable via logistic regression with shrinkage. We further explore the performance of RQBoost in the space of NLP and seizure prediction and find QA-enabled ML using QBoost and RQBoost is outperformed by traditional techniques. Additionally, we provide a detailed discussion of algorithmic constraints and trade-offs imposed by the use of this QA hardware. Through these experiments, we provide unique insights into the state of quantum ML via boosting and the use of quantum annealing hardware that are valuable to institutions interested in applying QA to problems in ML and beyond.
Quantum computing (QC) has become a fascinating and popular topic due to its broad range of applications, particularly in machine learning (ML). The intersection of QC and ML is known as Quantum Machine Learning (QML). QML is a field that investigates how QC can enhance ML, making it one of the most exciting areas of research due to the potential of QC in solving complex problems. In this paper, we demonstrate the Quantum Annealing (QA) approach to improving ML in binary classification tasks. We implemented the QBoost algorithm on a few datasets using D-Wave’s quantum computers, specifically the Advantage 1 and Advantage 2 prototypes, incorporating the new feature Fast Anneal.
In this chapter we are going to evaluate quantum models. The combining of numerous quantum systems or algorithms to increase performance and resilience is referred to as an ensemble in quantum evaluation models. QBoost is a quantum machine learning technique that is influenced by traditional boosting approaches. It combines several weak quantum classifiers to form a powerful ensemble. Quantum annealing is a strategy for solving optimization issues that makes use of quantum processes. It entails determining the lowest energy state of a physical system that corresponds to the problem’s goal function. The capacity of quantum annealing algorithms to produce optimal or near-optimal solutions in a tolerable time period is assessed, and their performance is compared to traditional optimization approaches. The performance of binary optimization techniques is measured in terms of discovering optimum or near-optimal solutions. Unconstrained binary optimization algorithms are evaluated by assessing their performance in terms of optimum or near-optimal solution discovery, convergence speed, and scalability. The Ising model is a mathematical model that describes how interacting spins behave in a magnetic substance. The Ising model is frequently used in quantum evaluation models as a framework for articulating optimization issues and translating them onto quantum systems. Quantum evaluation models must be compatible with the quantum computing hardware that is now available. The evaluation takes into account aspects such as the required number of qubits, connection restrictions, noise levels, gate availability, and error correction strategies. It is critical to evaluate how effectively a quantum evaluation model works.
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.
Machine Learning (ML) has been extensively utilized in various scientific and engineering domains. But the inherent constraints and computational complexity that arise in classical machine learning are particularly evident when dealing with large-scale, high-dimensional datasets or when attempting to solve intricate optimisation problems. Quantum systems exhibit unconventional patterns that are typically not effectively generated by traditional systems and can also tackle high dimensional and large size datasets efficiently. Therefore, it is believed that quantum computing systems may outperform traditional computing devices in machine learning tasks. Quantum Machine Learning (QML) has emerged as a rapidly developing field that combines the concepts of quantum mechanics and machine learning to solve complex problems across various disciplines. The domain of quantum machine learning investigates the development and execution of quantum software with the potential to facilitate machine learning at a much superior pace compared to traditional computers. However, the major challenges encountered are hardware limitations, noise, and development of quantum algorithms. The objective of this paper is to provide an insight on the foundational principles, essential algorithms, various associated platforms, potential applications and challenges being faced by QML. As data continues to grow in size and complexity, together with the emergence of nonlinear and high-dimensional real-world situations, the computing benefits offered by QML have the potential to facilitate significant advancements in the fields of healthcare, finance, robotics, logistics, communication, and cyber security. This paper presents the basis for future research work related to development of quantum algorithms in the domain of machine learning.
This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.
The development of quantum technologies opens new possibilities for the optimization of machine learning (ML) algorithms. In this contribution, we report on the experimental use of quantum computing for training ML algorithms and models designed to be deployed for inference on embedded systems with limited computational resources. Due to the small size of resource-efficient models for embedded systems, this application of quantum computing provides an excellent opportunity to evaluate a technology that is currently being developed in the noisy intermediate-scale quantum era. We develop an approach based on transforming classical supervised learning problems into a discrete form, enabling their solution using quantum annealing (QA) methods. Three models are presented: a binary XNORNet network, a support vector machine (SVM) with a discrete representation of dual coefficients, and a convolutional neural network. All experiments are performed on the MNIST dataset, using classical optimization methods, simulated annealing, and QA on the D-Wave Advantage system. While classical gradientbased methods maintain superior absolute accuracy (up to 95.97% for SVM), the D-Wave system demonstrates a significant reduction in core optimization time, achieving speedups of up to 15.6× compared to classical optimization on a central processing unit when the system overhead is excluded. Preliminary results suggest that while QA entails a slight accuracy and memory requirements penalty, a drastic reduction in active annealing duration serves as a promising strategy to reduce training latency in future embedded-focused ML applications.