Quantum Algorithm Solves Travelling Salesperson Problem with 1-Qubit

IIUC each combination is represented as a point in the sphere. The problem is to get enough precision to distinguish one point from another. The number of ways to travel grows exponentially, so they are very close for big maps.