This title appears in the Scientific Report :
2022
Please use the identifier:
http://hdl.handle.net/2128/33536 in citations.
On the hardness of quadratic unconstrained binary optimization problems
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...
Saved in:
Personal Name(s): | Mehta, Vrinda |
---|---|
Jin, Fengping / Michielsen, Kristel (Corresponding author) / De Raedt, Hans | |
Contributing Institute: |
Jülich Supercomputing Center; JSC |
Imprint: |
2022
|
Conference: | 11th NIC Symposium, Jülich (Germany), 2022-09-29 - 2022-09-30 |
Document Type: |
Poster |
Research Program: |
Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups |
Link: |
OpenAccess |
Publikationsportal JuSER |
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. |