Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization

03/23/2022
by   Alp Yurtsever, et al.
0

We present a hybrid classical-quantum framework based on the Frank-Wolfe algorithm, Q-FW, for solving quadratic, linearly-constrained, binary optimization problems on quantum annealers (QA). The computational premise of quantum computers has cultivated the re-design of various existing vision problems into quantum-friendly forms. Experimental QA realizations can solve a particular non-convex problem known as the quadratic unconstrained binary optimization (QUBO). Yet a naive-QUBO cannot take into account the restrictions on the parameters. To introduce additional structure in the parameter space, researchers have crafted ad-hoc solutions incorporating (linear) constraints in the form of regularizers. However, this comes at the expense of a hyper-parameter, balancing the impact of regularization. To date, a true constrained solver of quadratic binary optimization (QBO) problems has lacked. Q-FW first reformulates constrained-QBO as a copositive program (CP), then employs Frank-Wolfe iterations to solve CP while satisfying linear (in)equality constraints. This procedure unrolls the original constrained-QBO into a set of unconstrained QUBOs all of which are solved, in a sequel, on a QA. We use D-Wave Advantage QA to conduct synthetic and real experiments on two important computer vision problems, graph matching and permutation synchronization, which demonstrate that our approach is effective in alleviating the need for an explicit regularization coefficient.

READ FULL TEXT

page 9

page 11

page 26

research
01/19/2021

Quantum Permutation Synchronization

We present QuantumSync, the first quantum algorithm for solving a synchr...
research
01/19/2021

Solving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithms

Quadratic Unconstrained Binary Optimization (QUBO) is a broad class of o...
research
09/15/2021

Optimising Rolling Stock Planning including Maintenance with Constraint Programming and Quantum Annealing

We developed and compared Constraint Programming (CP) and Quantum Anneal...
research
10/24/2022

Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

Factorization Machine (FM) is the most commonly used model to build a re...
research
03/08/2021

Quantum-accelerated constraint programming

Constraint programming (CP) is a paradigm used to model and solve constr...
research
04/30/2021

Continuous black-box optimization with quantum annealing and random subspace coding

A black-box optimization algorithm such as Bayesian optimization finds e...
research
03/15/2022

QUBOs for Sorting Lists and Building Trees

We show that the fundamental tasks of sorting lists and building search ...

Please sign up or login with your details

Forgot password? Click here to reset