Feedback-Based Quantum Strategies for Constrained Combinatorial Optimization Problems

TL;DR

This paper extends feedback-based quantum algorithms to efficiently solve constrained combinatorial optimization problems with invalid configuration constraints, reducing circuit complexity and qubit requirements.

Contribution

It introduces a novel operator encoding feasible solutions and control techniques to directly handle IC constraints without slack variables.

Findings

Effective encoding of IC constraints as ground states

Reduced quantum circuit depth and qubit count

Successful numerical simulations demonstrating approach viability

Abstract

Feedback-based quantum algorithms have recently emerged as potential methods for approximating the ground states of Hamiltonians. One such algorithm, the feedback-based algorithm for quantum optimization (FALQON), is specifically designed to solve quadratic unconstrained binary optimization problems. Its extension, the feedback-based algorithm for quantum optimization with constraints (FALQON-C), was introduced to handle constrained optimization problems with equality and inequality constraints. In this work, we extend the feedback-based quantum algorithms framework to address a broader class of constraints known as invalid configuration (IC) constraints, which explicitly prohibit specific configurations of decision variables. We first present a transformation technique that converts the constrained optimization problem with invalid configuration constraints into an equivalent unconstrained problem by incorporating a penalizing term into the cost function. Then, leaning upon control theory, we propose an alternative method tailored for feedback-based quantum algorithms that directly tackles IC constraints without requiring slack variables. Our approach introduces a new operator that encodes the optimal feasible solution of the constrained optimization problem as its ground state. Then, a controlled quantum system based on the Lyapunov control technique is designed to ensure convergence to the ground state of this operator. Two approaches are introduced in the design of this operator to address IC constraints: the folded spectrum approach and the deflation approach. These methods eliminate the need for slack variables, significantly reducing the quantum circuit depth and the number of qubits required. We show the effectiveness of our proposed algorithms through numerical simulations.