Exponential Quantum Speedup for the Traveling Salesman Problem

ePrint Report: Exponential Quantum Speedup for the Traveling Salesman Problem

Anant Sharma, Nupur Deshpande, Sanchita Ghosh, Sreetama Das, Shibdas Roy

The traveling salesman problem is the problem of finding out the shortest route in a network of cities, that a salesman needs to travel to cover all the cities, without visiting the same city more than once. This problem is known to be $NP$-hard with a brute-force complexity of $O(N^N)$ or $O(N^{2N})$ for $N$ number of cities. This problem is …

a network cities eprint report network problem quantum report travel