top | item 41113268 Quantum Algorithm Solves Travelling Salesperson Problem with 1-Qubit 3 points| sigil | 1 year ago |discovermagazine.com 1 comment order hn newest gus_massa|1 year ago 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.
gus_massa|1 year ago 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.
gus_massa|1 year ago