Article thumbnail

Multi-block ADMM Heuristics for Mixed-Binary Optimization on Classical and Quantum Computers

By Claudio Gambella and Andrea Simonetto

Abstract

Solving combinatorial optimization problems on noisy intermediate-scale quantum (NISQ) devices is currently being advocated for (and restricted to) binary polynomial optimization with equality constraints via hybrid quantum/classical heuristic approaches. This is achieved using, e.g., the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA). We present a decomposition-based approach to extend the applicability of current approaches to mixed binary optimization (MBO) problems, so as to solve a broad class of real-world optimization problems. In the MBO framework, we show that the alternating direction method of multipliers (ADMM) can split the MBO into a binary unconstrained problem (that can be solved via variational quantum approaches), and continuous constrained convex subproblems (that can be solved cheaply with classical optimization solvers). The validity of the approach is then showcased by numerical results obtained on several optimization problems via simulations with VQE on the quantum circuits implemented in Qiskit, an open-source quantum computing software development framework

Topics: Quantum Physics, Mathematics - Optimization and Control
Year: 2020
OAI identifier: oai:arXiv.org:2001.02069

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.