arXiv:2501.03521 · IEEE Access

Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization

Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka

Published Jan 1, 2025• 4 citations

Abstract

In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than classical computers. Variational quantum algorithms, such as Variational Quantum Eigensolver (VQE), have been studied extensively because they are expected to work on noisy intermediate scale devices. Unfortunately, many optimization problems have constraints, which induces infeasible solutions during VQE process. Recently, several methods for efficiently solving constrained combinatorial optimization problems have been proposed by designing a quantum circuit so as to output only the states that satisfy the constraints. However, the types of available constraints are still limited. Therefore, we have started to develop variational quantum circuits that can handle a wider range of constraints. The proposed method utilizes a forwarding operation that maps from feasible states for subproblems to those for larger subproblems. As long as appropriate forwarding operations can be defined, iteration of this process can inductively construct variational circuits outputting feasible states even in the case of multiple and complex constraints. In this paper, the proposed method was applied to facility location problem. As a result, feasible solutions were obtained with 100%, and the probability of obtaining optimal solutions was over 22 times higher than that of conventional VQEs. Nevertheless, the cost of the obtained circuit was comparable to that of conventional circuits.

DOI: 10.1109/access.2025.3563960

Related papers

Solving constrained optimization problems via the variational quantum eigensolver with constraints

Thinh Viet Le, Vassilis Kekatos

Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks, including solving optimization problems. Nonetheless, optimization problems with constraints may not have been handled in a disciplined fashion thus far. To address this gap, this work proposes a hybrid quantum-classical algorithmic paradigm termed the variational quantum eigensolver with constraints (VQEC) that extends the celebrated VQE to handle optimization with constraints. As with the standard VQE, the vector of optimization variables is captured by the state of a variational quantum circuit (VQC). To deal with constraints, VQEC optimizes a Lagrangian function classically over both the VQC parameters as well as the dual variables associated with constraints. To comply with the quantum setup, variables are updated via a perturbed primal-dual method leveraging the parameter shift rule. Among a wide gamut of potential applications, we showcase how VQEC can approximately solve quadratically constrained binary optimization problems, find stochastic binary policies satisfying quadratic constraints on the average and in probability, and solve large-scale linear programs over the probability simplex. Under an assumption on the error for the VQC to approximate an arbitrary probability mass function, we provide bounds on the optimality gap attained by a VQC. Numerical tests on a quantum simulator investigate the effect of various parameters and corroborate that VQEC can generate high-quality solutions.

Physical Review AAug 20, 202415 citations

Quantum-Enhanced Algorithms for Combinatorial Optimization

Jincheng Zhang

This paper investigates the potential of quantum computing to accelerate combinatorial optimization algorithms. Traditional combinatorial optimization problems, such as the Traveling Salesperson Problem (TSP) and the Integer Linear Programming (ILP), often require exponential time to solve with classical algorithms. We propose a framework leveraging quantum algorithms, specifically the Variational Quantum Eigensolver (VQE), to tackle these problems. The core idea involves mapping the optimization problem into a quantum circuit, where the VQE algorithm iteratively refines a quantum state to find the optimal solution. We explore the theoretical underpinnings of this approach, focusing on the challenges and opportunities associated with quantum state preparation, measurement, and error mitigation. The paper provides a conceptual outline of the methodology and discusses potential improvements and future research directions. We demonstrate the feasibility of applying quantum computing to combinatorial optimization and highlight the potential for significant speedups compared to classical methods, especially as quantum hardware matures.

Aug 31, 20260 citations

Variational Quantum Eigensolver with Constraints (VQEC): Solving Constrained Optimization Problems via VQE

Thinh Viet Le, Vassilis Kekatos

Variational quantum approaches have shown great promise in finding near-optimal solutions to computationally challenging tasks. Nonetheless, enforcing constraints in a disciplined fashion has been largely unexplored. To address this gap, this work proposes a hybrid quantum-classical algorithmic paradigm termed VQEC that extends the celebrated VQE to handle optimization with constraints. As with the standard VQE, the vector of optimization variables is captured by the state of a variational quantum circuit (VQC). To deal with constraints, VQEC optimizes a Lagrangian function classically over both the VQC parameters as well as the dual variables associated with constraints. To comply with the quantum setup, variables are updated via a perturbed primal-dual method leveraging the parameter shift rule. Among a wide gamut of potential applications, we showcase how VQEC can approximately solve quadratically-constrained binary optimization (QCBO) problems, find stochastic binary policies satisfying quadratic constraints on the average and in probability, and solve large-scale linear programs (LP) over the probability simplex. Under an assumption on the error for the VQC to approximate an arbitrary probability mass function (PMF), we provide bounds on the optimality gap attained by a VQC. Numerical tests on a quantum simulator investigate the effect of various parameters and corroborate that VQEC can generate high-quality solutions.

arXiv:2311.08502Nov 14, 20234 citations

A Quantum Approach for Stochastic Constrained Binary Optimization

Sarthak Gupta, Vassilis Kekatos

Analytical and practical evidence indicates the advantage of quantum computing solutions over classical alternatives. Quantum-based heuristics relying on the variational quantum eigensolver (VQE) and the quantum approximate optimization algorithm (QAOA) have been shown numerically to generate high-quality solutions to hard combinatorial problems, yet incorporating constraints to such problems has been elusive. To this end, this work puts forth a quantum heuristic to cope with stochastic binary quadratically constrained quadratic programs (QCQP). Identifying the strength of quantum circuits to efficiently generate samples from probability distributions that are otherwise hard to sample from, the variational quantum circuit is trained to generate binaryvalued vectors to approximately solve the aforesaid stochastic program. The method builds upon dual decomposition and entails solving a sequence of judiciously modified standard VQE tasks. Tests on several synthetic problem instances using a quantum simulator corroborate the near-optimality and feasibility of the method, and its potential to generate feasible solutions for the deterministic QCQP too.

arXiv:2301.01443IEEE International Conference on Acoustics Speech and Signal ProcessingMay 5, 20234 citations

Enhancing computational accuracy with parallel parameter optimization in variational quantum eigensolver

Daisuke Tsukayama, Jun‐ichi Shirakashi, Tetsuo Shibuya +1 more

Variational quantum algorithms have promising applications in noisy intermediate-scale quantum (NISQ) devices. These algorithms rely on a classical optimization outer loop that minimizes a parameterized quantum circuit function. The optimization in variational quantum eigensolver (VQE) is NP-hard, meaning that finding the optimal solution is infeasible in the worst-case scenario. One way to address this challenge is through parallel optimization of parameters using multiple-parameterized quantum circuits. However, this approach is unsuitable for cloud-based quantum processing unit utilization due to the increased number of quantum circuit executions. Although NISQ devices have limitations in terms of gate depth, their size has been growing in recent years. Therefore, implementing multiple-parameterized quantum circuits in NISQ devices can suppress the increase in the number of executions. In this study, we propose a parallel-VQE, which leverages the parallel execution of parameterized quantum circuits to perform parallel parameter optimization in VQE, achieving convergence to solutions closer to the ground state. We validate the effectiveness of parallel-VQE in solving the random weighted max-cut problem using numerical simulations and a real quantum device. We present the results of running up to six circuits in parallel (120 qubits) and demonstrate the advantages of using multiple units to improve computational accuracy. This study provides a potential method for solving eigenvalue problems and combinatorial optimization problems for future quantum devices.

AIP AdvancesJan 1, 20258 citations

Variational Quantum Algorithm for Constrained Combinatorial Optimization Problems

Hui-Min Li, Yuan-Liang Han, Zhi-Xi Wang +1 more

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.

quant-pharXiv:2603.05833Physical Review AMar 9, 20260 citations