A Subgradient Approach for Constrained Binary Optimization via Quantum Adiabatic Evolution

Understand

An earlier work [18] proposes a method for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution using an outer approximation method.

• This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-free quantum adiabatic system.
• However, current implementations of quantum annealing systems demand methods that are efficient at handling possible sources of noise.
• In this paper, we consider a subgradient method for finding an optimal primal-dual pair for the Lagrangian dual of a constrained binary polynomial programming problem.