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

Springer eBooks

Quantum Annealing for Real-World Machine Learning Applications

Rajdeep Kumar Nath, Himanshu Thapliyal, Travis S. Humble

Published Aug 7, 2023• 2 citations
Publisher
DOI
10.1007/978-3-031-37966-6_9

Related papers

A Review of Machine Learning Classification Using Quantum Annealing for Real-World Applications

Rajdeep Kumar Nath, Himanshu Thapliyal, Travis S. Humble

arXiv:2106.02964•SN Computer Science•Jul 3, 2021•53 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•9 citations

Integration of Machine Learning with Quantum Annealing

Hadi Salloum, Hamza Shafee Aldaghstany, Osama Orabi +3 more

Lecture notes on data engineering and communications technologies•Jan 1, 2024•15 citations

Quantum annealing in statistical machine learning

一誠 佐藤

•Jan 1, 2011•0 citations

New frontier of machine learning and computation initiated by quantum annealing

Masayuki Ohzeki

IEICE Technical Report; IEICE Tech. Rep.•Dec 14, 2016•0 citations

Boosting the performance of quantum annealers using machine learning

Jure Brence, Dragan Mihailovic, V. V. Kabanov +3 more

Abstract Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubits. The size of problems that can be solved by quantum annealers is limited mainly by errors caused by environmental noise and intrinsic imperfections of the processor. We address the issue of intrinsic imperfections with a novel error correction approach, based on machine learning methods. Our approach adjusts the input Hamiltonian to maximize the probability of finding the solution. In our experiments, the proposed error correction method improved the performance of annealing by up to three orders of magnitude and enabled the solving of a previously intractable, maximally complex problem.

arXiv:2203.02360•Quantum Machine Intelligence•Jan 22, 2023•3 citations
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.
Abstract Noisy intermediate-scale quantum (NISQ) devices are spearheading the second quantum revolution. Of these, quantum annealers are the only ones currently offering real world, commercial applications on as many as 5000 qubits. The size of problems that can be solved by quantum annealers is limited mainly by errors caused by environmental noise and intrinsic imperfections of the processor. We address the issue of intrinsic imperfections with a novel error correction approach, based on machine learning methods. Our approach adjusts the input Hamiltonian to maximize the probability of finding the solution. In our experiments, the proposed error correction method improved the performance of annealing by up to three orders of magnitude and enabled the solving of a previously intractable, maximally complex problem.