Quantum Algorithm Solves Travelling Salesperson Problem with 1-Qubitdiscovermagazine.com 3 pointssigil2 years ago1 commentSaveHideCopy link On HNComments−gus_massa2yIIUC 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.
Comments
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.