[4B3-GS-1] Fundamental AI, theory (2)

[4B3-GS-1-02] Application to optimization problem with multiple constraints using quantum approximation optimization algorithm (QAOA)

〇Koudai Shiba^1,2, Chih-Chieh Chen², Masaru Sogabe², Katsuyoshi Sakamoto¹, Koichi Yamaguchi¹, Tomah Sogabe^1,2 (1. The University of Electro-Communications, 2. Gric Inc.)

Keywords:QAOA, Multiple Constraints, Hamiltonian mix

Solutions to optimization problems using gated quantum computers include those using the VQE algorithm and those using the QAOA algorithm, and are currently attracting attention as one of the solutions to real-world optimization problems. The calculation method of the optimization problem using the gate type quantum computer has higher expandability than the calculation method by the quantum annealing, and may be able to cope with various types of optimization problems. However, a correct optimal solution for a complex optimization problem considering multiple constraints has not been established yet. Therefore, in this work, we apply the Hamiltonian mixed method, which is one of the calculation methods for the optimization problem closer to the real problem in consideration of the constraints, and verify its effectiveness.