Showing 2024 · quant-phShow all
3 papers · 2 filters
quant-ph2024
Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy
Chen-Yu Liu, Hiromichi Matsuyama, Wei-hao Huang +1
We present novel path-slicing strategies integrated with quantum local search to optimize solutions for the Traveling Salesman Problem (TSP), addressing the limitations of current…
quant-ph2024
Efficient Internal Strategies in Quantum Relaxation based Branch-and-Bound
Hiromichi Matsuyama, Wei-hao Huang, Kohji Nishimura +1
A combinatorial optimization problem is to find an optimal solution under the constraints. This is one of the potential applications for quantum computers. Quantum Random Access Op…
quant-ph2024
Linearly simplified QAOA parameters and transferability
Ryo Sakai, Hiromichi Matsuyama, Wai-Hong Tam +2
Quantum Approximate Optimization Algorithm (QAOA) provides a way to solve combinatorial optimization problems using quantum computers. QAOA circuits consist of time evolution opera…