Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm - Université Clermont Auvergne
Conference Papers Year : 2024

Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm

Abstract

The Quantum Approximate Optimization Algorithm is the hybrid classic-quantum algorithm that is used for solving the combinatorial optimization problem. However, the algorithm performs poorly in the constrained combinatorial optimization problem because it considers all solutions with the same initial probability. In this article, we propose a new quantum state that improves the QAOA performance and does not require slack variables for inequality constraints. We also introduce some properties of our new quantum state in solving a constrained combinatorial optimization problem. To see our method’s efficiency, we use our method to solve the quadratic knapsack problem and compare it with the quantum state method of Hao et al. [5] which is one of the most recent and effective methods for solving the constrained combinatorial optimization.
No file

Dates and versions

hal-04636531 , version 1 (05-07-2024)

Identifiers

Cite

Huy Phuc Nguyen Ha, Viet Hung Nguyen, Anh Son Ta. Solving Quadratic Knapsack Problem with Biased Quantum State Optimization Algorithm. Metaheuristics International Conference (MIC 2024), Jun 2024, Lorient, France. pp.268-280, ⟨10.1007/978-3-031-62912-9_26⟩. ⟨hal-04636531⟩
60 View
0 Download

Altmetric

Share

More