# Using machine learning for quantum annealing accuracy prediction

arXiv: https://arxiv.org/abs/2106.00065 · HTML: https://mlsanity.com/paper/2106.00065/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 3 of its 30 references that are in the map.
- First posted on arXiv 31 May 2021.

## Builds on (most cited first, 3 of 3)

- [Ising formulations of many NP problems](https://mlsanity.com/paper/1302.5843/) (2013)
- [Learning to learn with quantum neural networks via classical neural networks](https://mlsanity.com/paper/1907.05415/) (2019)
- [Optimizing embedding-related quantum annealing parameters for reducing hardware bias](https://mlsanity.com/paper/2011.00719/) (2020)

## Built on by (most cited first, 2 of 2)

- [Nonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing](https://mlsanity.com/paper/2311.01028/) (2023)
- [Adiabatic Quantum Support Vector Machines](https://mlsanity.com/paper/2401.12485/) (2024)

## Abstract (arXiv)

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or QUBO (quadratic unconstrained binary optimization) form. Although such solutions are typically of very high quality, problem instances are usually not solved to optimality due to imperfections of the current generations quantum annealers. In this contribution, we aim to understand some of the factors contributing to the hardness of a problem instance, and to use machine learning models to predict the accuracy of the D-Wave 2000Q annealer for solving specific problems. We focus on the Maximum Clique problem, a classic NP-hard problem with important applications in network analysis, bioinformatics, and computational chemistry. By training a machine learning classification model on basic problem characteristics such as the number of edges in the graph, or annealing parameters such as D-Wave's chain strength, we are able to rank certain features in the order of their contribution to the solution hardness, and present a simple decision tree which allows to predict whether a problem will be solvable to optimality with the D-Wave 2000Q. We extend these results by training a machine learning regression model that predicts the clique size found by D-Wave.