On the hardness of quadratic unconstrained binary optimization problems

We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving man...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers in physics Vol. 10
Main Authors: Mehta, V., Jin, F., Michielsen, K., De Raedt, H.
Format: Journal Article
Language:English
Published: Frontiers Media S.A 31.08.2022
Subjects:
hamming distance
level spacing distribution
quantum annealer
QUBO problem
success probability
ISSN:2296-424X, 2296-424X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving many instances of up to 170-variable, quadratic unconstrained binary optimization problems. Our results demonstrate that the exponents characterizing the success probability of a D-Wave annealer to solve a quadratic unconstrained binary optimization correlate very well with the predictions based on the Hamming distance distributions computed for small problem instances.
ISSN:2296-424X
2296-424X
DOI:10.3389/fphy.2022.956882