DeepAI AI Chat
Log In Sign Up

Quantum speedup of branch-and-bound algorithms

by   Ashley Montanaro, et al.
University of Bristol

Branch-and-bound is a widely used technique for solving combinatorial optimisation problems where one has access to two procedures: a branching procedure that splits a set of potential solutions into subsets, and a cost procedure that determines a lower bound on the cost of any solution in a given subset. Here we describe a quantum algorithm that can accelerate classical branch-and-bound algorithms near-quadratically in a very general setting. We show that the quantum algorithm can find exact ground states for most instances of the Sherrington-Kirkpatrick model in time O(2^0.226n), which is substantially more efficient than Grover's algorithm.


page 1

page 2

page 3

page 4


Improved Classical and Quantum Algorithms for Subset-Sum

We present new classical and quantum algorithms for solving random subse...

Branch and bound algorithm for the traveling salesman problem is not a direct type algorithm

In this paper, we consider the notion of a direct type algorithm introdu...

Quantum algorithm for Dyck Language with Multiple Types of Brackets

We consider the recognition problem of the Dyck Language generalized for...

Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns

Electronic phased-array radars offer new possibilities for radar search ...

Improved Branch-and-Bound for Low Autocorrelation Binary Sequences

The Low Autocorrelation Binary Sequence problem has applications in tele...

Learning Computation Bounds for Branch-and-Bound Algorithms to k-plex Extraction

k-plex is a representative definition of communities in networks. While ...