Solving QUBOs with a quantum-amenable branch and bound method

Thomas Häner, Kyle E. C. Booth, Sima E. Borujeni +1

Due to the expected disparity in quantum vs. classical clock speeds, quantum advantage for branch and bound algorithms is more likely achievable in settings involving large search…