% IMPORTANT: The following is UTF-8 encoded. This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.
@INPROCEEDINGS{Mehta:917315,
author = {Mehta, Vrinda and Jin, Fengping and Michielsen, Kristel and
De Raedt, Hans},
title = {{O}n the hardness of quadratic unconstrained binary
optimization problems},
school = {RWTH Aachen University},
reportid = {FZJ-2023-00543},
year = {2022},
abstract = {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.},
month = {Sep},
date = {2022-09-29},
organization = {11th NIC Symposium, Jülich (Germany),
29 Sep 2022 - 30 Sep 2022},
subtyp = {Other},
cin = {JSC},
cid = {I:(DE-Juel1)JSC-20090406},
pnm = {5111 - Domain-Specific Simulation $\&$ Data Life Cycle Labs
(SDLs) and Research Groups (POF4-511)},
pid = {G:(DE-HGF)POF4-5111},
typ = {PUB:(DE-HGF)24},
url = {https://juser.fz-juelich.de/record/917315},
}