A Subgradient Approach for Constrained Binary Optimization via Quantum Adiabatic Evolution
By Sahar Karimi & Pooya Ronagh
An earlier work 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. We then study the quadratic stable set (QSS) problem as a case study. We see that this method applied to the QSS problem can be viewed as an instance-dependent penalty-term approach that avoids large penalty coefficients. Finally, we report our experimental results of using the D-Wave 2X quantum annealer and conclude that our approach helps this quantum processor to succeed more often in solving these problems compared to the usual penalty-term approaches.
Presented at: Canadian Operational Research Society (CORS) 58th Annual Conference 2016
Most Recent Papers
Scaling Overhead of Locality Reduction in Binary Optimization Problems
By Elisabetta Valiante, Maritza Hernandez, Amin Barzegar, & Helmut G. Katzgraber Recently, there has been considerable interest in solving optimization problems by mapping these onto a binary representation, sparked mostly by the use of quantum annealing machines....
Quantum Multiple Kernel Learning
By Seyed Shakib Vedaie, Moslem Noori, Jaspreet S. Oberoi, Barry C. Sanders, & Ehsan Zahedinejad Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance on numerous machine learning tasks....
Quantum Annealing Approaches to the Phase-Unwrapping Problem in Synthetic-Aperture Radar Imaging
By Khaled A. Helal Kelany, Nikitas Dimopoulos, Clemens P. J. Adolphs, Bardia Barabadi, & Amirali Baniasadi The focus of this work is to explore the use of quantum annealing solvers for the problem of phase unwrapping of synthetic aperture radar (SAR) images....
Finding the Ground State of Spin Hamiltonians with Reinforcement Learning
By Kyle Mills, Pooya Ronagh, & Isaac Tamblyn Reinforcement learning (RL) has become a proven method for optimizing a procedure for which success has been defined, but the specific actions needed to achieve it have not. Using a method we call "controlled online...
Variationally Scheduled Quantum Simulation
By Shunji Matsuura, Samantha Buck, Valentin Senicourt, & Arman Zaribafiyan Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation...