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

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!