On the hardness of quadratic unconstrained binary optimization problems

HIGHLIGHTS

• who: QUBO problem and collaborators from the Hunan Normal University, China have published the paper: On the hardness of quadratic unconstrained binary optimization problems, in the Journal: (JOURNAL)
• what: The authors show, using three classes of problems, that the following two factors are well correlated: 2 Quadratic unconstrained binary optimization problems 2.1 2-Satisfiability problems The authors demonstrate that the differences between the Hamming distance distributions are correlated with the size-dependent scaling of the success probabilities with which D-Wave quantum annealers find the ground_state. The authors use qbsolv, a heuristic solver provided . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.