TL;DR
This paper introduces a meta-learning approach to predict the effectiveness of Quantum Annealing on QUBO problems, using a large dataset and features to understand problem characteristics influencing solver success.
Contribution
It presents a novel methodology combining dataset creation, feature analysis, and meta-models to predict QA performance, advancing understanding of problem features affecting quantum solver effectiveness.
Findings
Meta-models can accurately predict QA success.
Distribution of problem coefficients impacts QA effectiveness.
Density of coefficients alone is insufficient for prediction.
Abstract
The field of Quantum Computing has gathered significant popularity in recent years and a large number of papers have studied its effectiveness in tackling many tasks. We focus in particular on Quantum Annealing (QA), a meta-heuristic solver for Quadratic Unconstrained Binary Optimization (QUBO) problems. It is known that the effectiveness of QA is dependent on the task itself, as is the case for classical solvers, but there is not yet a clear understanding of which are the characteristics of a problem that makes it difficult to solve with QA. In this work, we propose a new methodology to study the effectiveness of QA based on meta-learning models. To do so, we first build a dataset composed of more than five thousand instances of ten different optimization problems. We define a set of more than a hundred features to describe their characteristics, and solve them with both QA and three…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsSparse Evolutionary Training · Focus
