1 paper
Yuefeng Lin, Chao Zheng, Cong Guo
The Traveling Salesman Problem (TSP) is a prototypical combinatorial optimization problem, but its quantum implementation is limited by the O(n^2)-qubit overhead of standard one-ho…