講演情報
[15p-K406-5]Avoiding Invalid Quantum State in HOBO for Advancing Traveling Salesman Problem
〇Juncheng Wang1, Daisuke Tsukayama1, Takumi Kanezashi1, Jun-ichi Shirakashi1, Tetsuo Shibuya2, Hiroshi Imai2 (1.Tokyo Univ. Agr. & Tech., 2.Univ. Tokyo)
キーワード：
Gate-Based Quantum Computer、Variational Quantum Eigensolver、Traveling Salesman Problem
In the study of the Traveling Salesman Problem (TSP) using quantum computers, the well-known Quadratic Unconstrained Binary Optimization (QUBO) formulation is often a primary choice. However, due to its high demand for quantum bits, researchers have proposed a more efficient Higher Order Binary Optimization (HOBO) formulation, which reduces the required number of qubits from O(N2) to O(N log N). Despite this improvement, both methods rely on penalty functions that involve two constraint terms. Building on this foundation, we propose a novel encoding approach that reduces the number of constraints. By leveraging this approach, we can effectively eliminate invalid terms.