Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Using Machine Learning for Quantum Annealing Accuracy Prediction

Journal Article · · Algorithms
DOI:https://doi.org/10.3390/a14060187· OSTI ID:1814792
 [1];  [1];  [2];  [3]
  1. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
  2. Harvard Univ., Boston, MA (United States)
  3. Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Bulgarian Academy of Sciences, Sofia (Bulgaria)

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 quadratic unconstrained binary optimization (QUBO) 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 the 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.

Research Organization:
Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE Laboratory Directed Research and Development (LDRD) Program; USDOE National Nuclear Security Administration (NNSA)
Grant/Contract Number:
89233218CNA000001
OSTI ID:
1814792
Report Number(s):
LA-UR--21-25091
Journal Information:
Algorithms, Journal Name: Algorithms Journal Issue: 6 Vol. 14; ISSN 1999-4893
Publisher:
MDPICopyright Statement
Country of Publication:
United States
Language:
English

References (9)

Clique is hard to approximate within n1−ε journal January 1999
Finding Maximum Cliques on the D-Wave Quantum Annealer journal May 2018
Strong computational lower bounds via parameterized complexity journal December 2006
Random Forests journal January 2001
Learning the quantum algorithm for state overlap journal November 2018
To quantum or not to quantum: towards algorithm selection in near-term quantum optimization journal October 2020
Machine Learning for Discriminating Quantum Measurement Trajectories and Improving Readout journal May 2015
Reinforcement-learning-assisted quantum optimization journal September 2020
Ising formulations of many NP problems journal January 2014

Similar Records

Finding Maximum Cliques on the D-Wave Quantum Annealer
Journal Article · Thu May 03 00:00:00 EDT 2018 · Journal of Signal Processing Systems · OSTI ID:1438358

Noise dynamics of quantum annealers: estimating the effective noise using idle qubits
Journal Article · Fri Apr 21 00:00:00 EDT 2023 · Quantum Science and Technology · OSTI ID:1983855