%0 Conference Paper
%A Mehta, Vrinda
%A Jin, Fengping
%A Michielsen, Kristel
%A De Raedt, Hans
%T On the hardness of quadratic unconstrained binary optimization problems
%I RWTH Aachen University
%M FZJ-2023-00543
%D 2022
%X 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 QUBO correlate very well with the predictions based on the Hamming distance distributions computed for small problem instances.
%B 11th NIC Symposium
%C 29 Sep 2022 - 30 Sep 2022, Jülich (Germany)
Y2 29 Sep 2022 - 30 Sep 2022
M2 Jülich, Germany
%F PUB:(DE-HGF)24
%9 Poster
%U https://juser.fz-juelich.de/record/917315