Quantum Algorithm Solves Travelling Salesperson Problem with 1-Qubit (discovermagazine.com) 3 points by sigil 2y ago ↗ HN
[–] gus_massa 2y 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.
1 comment
[ 2.6 ms ] story [ 15.5 ms ] thread