Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems

• URL: http://arxiv.org/abs/2603.05833v1
• Date: Fri, 06 Mar 2026 02:37:05 GMT
• Title: Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems
• Abstract summary: Penalty-based variational quantum algorithms suffer from a fundamental limitation: inefficient sampling in vast infeasible regions.<n>We introduce an alternative VQA whose core innovation lies in a strategically designed loss function.<n>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.
• Score: 0.7024739861125416
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Scalable Variational Quantum Optimization via Pauli Correlation Encoding: Application to Large-Scale Power Demand Portfolio Optimization [14.022615381217628]
  We introduce a scalable variational framework based on Pauli correlation encoding (PCE) and apply it to electric power demand portfolio optimization.<n> Numerical simulations demonstrate near-optimal performance across problem sizes ranging from $m$=18 to 10,296, with normalized cost gaps on the order of $10-4$ relative to solutions with certified optimality.
  arXiv  Detail & Related papers  (2026-07-27T17:55:23Z)
• Adaptive Graph Shrinking for Quantum Optimization of Constrained Combinatorial Problems [4.266376725904727]
  We propose a hybrid classical--quantum framework based on graph shrinking to reduce the number of variables and constraints in QUBO formulations of optimization problems.<n>Our approach improves solution feasibility, reduces repair complexity, and enhances quantum optimization quality on hardware-limited instances.
  arXiv  Detail & Related papers  (2025-06-17T07:11:48Z)
• Efficient QAOA Architecture for Solving Multi-Constrained Optimization Problems [3.757262277494307]
  This paper proposes a novel combination of constraint encoding methods for the Quantum Approximate Optimization Ansatz.<n>One-hot constraints are enforced through $XY$-mixers that restrict the search space to the feasible sub-space naturally.<n>Since $XY$-mixers restrict the search space, specific state vector entries are always zero and can be omitted from the simulation, saving valuable memory and computing resources.
  arXiv  Detail & Related papers  (2025-06-03T17:46:53Z)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex.<n>Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs.<n>We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Symmetric Tensor Networks for Generative Modeling and Constrained Combinatorial Optimization [72.41480594026815]
  Constrained optimization problems abound in industry, from portfolio optimization to logistics. One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space. In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
  arXiv  Detail & Related papers  (2022-11-16T18:59:54Z)
• Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization [7.541345730271882]
  In general, such constraints cannot be easily encoded in the circuit, and the quantum circuit measurement outcomes are not guaranteed to respect the constraints. We propose a new approach for solving constrained optimization problems with unimplement, easy-to-constrained quantum ansatze. We implement our method in QVoice, a Python package that interfaces with Qiskit for quick prototyping in simulators and on quantum hardware.
  arXiv  Detail & Related papers  (2022-11-13T20:58:00Z)
• A Constrained Optimization Approach to Bilevel Optimization with Multiple Inner Minima [49.320758794766185]
  We propose a new approach, which convert the bilevel problem to an equivalent constrained optimization, and then the primal-dual algorithm can be used to solve the problem. Such an approach enjoys a few advantages including (a) addresses the multiple inner minima challenge; (b) fully first-order efficiency without Jacobian computations.
  arXiv  Detail & Related papers  (2022-03-01T18:20:01Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.