Solving constrained quadratic binary problems via quantum adiabatic evolution
Optimization and Control
2018-02-13 v2 Emerging Technologies
Quantum Physics
Abstract
Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained. For constrained problems, it is a common practice to relax linear equality constraints as penalty terms in the objective function. However, there has not yet been proposed a method for efficiently dealing with inequality constraints using the quantum adiabatic approach. In this paper, we give a method for solving the Lagrangian dual of a binary quadratic programming (BQP) problem in the presence of inequality constraints and employ this procedure within a branch-and-bound framework for constrained BQP (CBQP) problems.
Cite
@article{arxiv.1509.05001,
title = {Solving constrained quadratic binary problems via quantum adiabatic evolution},
author = {Pooya Ronagh and Brad Woods and Ehsan Iranmanesh},
journal= {arXiv preprint arXiv:1509.05001},
year = {2018}
}
Comments
20 pages, 2 figures