Quantum speedup of branch-and-bound algorithms

Quantum computers could significantly outperform their classical counterparts for solving hard optimization problems. One prominent classical technique for such problems is known as branch-and-bound. This work describes a quantum algorithm for accelerating general branch-and-bound methods, and gives an application to spin glasses.