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 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 quadratic unconstrained binary optimization correlate very well with the predictions based on the Hamming distance distributions computed for small problem instances.

[1]  F. Jin,et al.  Quantum annealing for hard 2-satisfiability problems: Distribution and scaling of minimum energy gap and success probability , 2022, Physical Review A.

[2]  Damián Alvarez.  JUWELS Cluster and Booster: Exascale Pathfinder with Modular Supercomputing Architecture at Juelich Supercomputing Centre , 2021, Journal of large-scale research facilities JLSRF.

[3]  F. Jin,et al.  Quantum annealing with trigger Hamiltonians: Application to 2-satisfiability and nonstoquastic problems , 2021, Physical Review A.

[4]  Fred W. Glover,et al.  Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis , 2017, Networks.

[5]  Neuhaus Thomas,et al.  Monte Carlo Search for Very Hard KSAT Realizations for Use in Quantum Annealing , 2014, 1412.5361.

[6]  Neuhaus Thomas.  Quantum Searches in a Hard 2SAT Ensemble , 2014, 1412.5460.

[7]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[8]  M. W. Johnson,et al.  Quantum annealing with manufactured spins , 2011, Nature.

[9]  H. Nishimori,et al.  Quantum annealing in the transverse Ising model , 1998, cond-mat/9804280.

[10]  F. Barahona.  On the computational complexity of Ising spin glass models , 1982 .

[11]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..

[12]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[13]  V. Fock,et al.  Beweis des Adiabatensatzes , 1928 .

[14]  The D-Wave Advantage System : An Overview , 2020 .

[15]  P. Mahadevan,et al.  An overview , 2007, Journal of Biosciences.

[16]  M. Krom.  The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary , 1967 .