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 trailmaster challenger 200x 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 17