Copositive programming for mixed-binary quadratic optimization via Ising solvers

by   Robin Brown, et al.

Recent years have seen significant advances in quantum/quantum-inspired technologies capable of approximately searching for the ground state of Ising spin Hamiltonians. The promise of leveraging such technologies to accelerate the solution of difficult optimization problems has spurred an increased interest in exploring methods to integrate Ising problems as part of their solution process, with existing approaches ranging from direct transcription to hybrid quantum-classical approaches rooted in existing optimization algorithms. Due to the heuristic and black-box nature of the underlying Ising solvers, many such approaches have limited optimality guarantees. While some hybrid algorithms may converge to global optima, their underlying classical algorithms typically rely on exhaustive search, making it unclear if such algorithmic scaffolds are primed to take advantage of speed-ups that the Ising solver may offer. In this paper, we propose a framework for solving mixed-binary quadratic programs (MBQP) to global optimality using black-box and heuristic Ising solvers. We show the exactness of a convex copositive reformulation of MBQPs, which we propose to solve via a hybrid quantum-classical cutting-plane algorithm. The classical portion of this hybrid framework is guaranteed to be polynomial time, suggesting that when applied to NP-hard problems, the complexity of the solution is shifted onto the subroutine handled by the Ising solver.


page 1

page 2

page 3

page 4


DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems

The fast-growing need for grey-box and black-box optimization methods fo...

Omnisolver: an extensible interface to Ising spin glass solvers

We introduce a new framework for implementing Binary Quadratic Model (BQ...

Application of QUBO solver using black-box optimization to structural design for resonance avoidance

Quadratic unconstrained binary optimization (QUBO) solvers can be applie...

NISQ Algorithm for Semidefinite Programming

Semidefinite Programming (SDP) is a class of convex optimization program...

Faster quantum and classical SDP approximations for quadratic binary optimization

We give a quantum speedup for solving the canonical semidefinite program...

A Parallel Ensemble of Metaheuristic Solvers for the Traveling Salesman Problem

The travelling salesman problem (TSP) is one of the well-studied NP-hard...

Logspace Sequential Quadratic Programming for Design Optimization

A novel approach to exploiting the log-convex structure present in many ...

Please sign up or login with your details

Forgot password? Click here to reset