A Hybrid Classical-Quantum Annealing Algorithm for the TSP
量子物理
2026-05-12 v1 新兴技术
摘要
Hybrid quantum-classical algorithms can help mitigating the physical limitations of current quantum devices, particularly the low qubit count and the reduced topological connectivity. In this paper, we propose a hybrid technique to solve a well-known NP-hard optimization problem: the Traveling Salesperson Problem (TSP). Our approach is based on a graph contraction technique that removes most of the dimensionality of the original problem instance, producing a sub-TSP of a size suitable to be efficiently solved by a quantum device. The performance of our approach is first demonstrated on classical quantum simulation using Path Integral Monte Carlo, and then run on a D-Wave quantum annealer.
引用
@article{arxiv.2605.09616,
title = {A Hybrid Classical-Quantum Annealing Algorithm for the TSP},
author = {Siwei Hu and Victor Lopata and Salvatore Sinno and Shruthi Thuravakkath and Paolo Zuliani},
journal= {arXiv preprint arXiv:2605.09616},
year = {2026}
}