Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems

TL;DR

This paper introduces a novel variational quantum algorithm with a specially designed loss function that guarantees optimal feasible solutions and improves performance on constrained combinatorial problems, requiring less complex circuits.

Contribution

The paper proposes a new VQA with a loss function that uniquely identifies optimal feasible solutions and differentiates feasible from infeasible regions, reducing circuit complexity.

Findings

Successfully solved minimum vertex cover problems.

Effectively addressed maximum independent set problems.

Enhanced solution quality and convergence speed.

Abstract

While variational quantum algorithms (VQAs) have demonstrated considerable success in unconstrained optimization, their application to constrained combinatorial problems face a trade-off. Penalty-based methods, despite their circuit simplicity, suffer from a fundamental limitation: inefficient sampling in vast infeasible regions. This often results in suboptimal solutions that violate constraints and impede convergence to high-quality results. In contrast, ansatz-based approaches enforce solution feasibility by design but require complex, problem-specific circuits that are challenging to implement on current noisy intermediate-scale quantum devices. To overcome these limitations, we introduce an alternative VQA whose core innovation lies in a strategically designed loss function. This function offers a dual advantage. First, it is provably guaranteed that its global minimum corresponds uniquely to the optimal feasible solution, as this is achieved by ensuring universally higher loss values for all infeasible solutions. Second, it furnishes distinct computational pathways for feasible versus infeasible regions, thus creating clear and non competing guidance for the optimizer. As a result of these combined features, the algorithm's overall performance is significantly enhanced. Regarding hardware overhead, our design requires adding only an efficient validation oracle module to the penalty-based circuit, resulting in a circuit complexity significantly lower than that of ansatz-based approaches with their custom mixers. To validate the practical efficiency of our method, we empirically demonstrate its effectiveness by solving minimum vertex cover and maximum independent set problems on random graphs of varying small-scale sizes.