Solving constrained quadratic binary problems via quantum adiabatic evolution
2016 ◽
Vol 16
(11&12)
◽
pp. 1029-1047
Keyword(s):
A Priori
◽
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.
2016 ◽
Vol 44
(6)
◽
pp. 702-705
◽
2007 ◽
Vol 41
(3)
◽
pp. 349-362
◽
2011 ◽
Vol 38
(6)
◽
pp. 7817-7827
◽
2014 ◽
Vol 101
◽
pp. 103-112
◽