4 ms·
So it is more efficient at exploring the solution territory of traveling salesman type problems than classical computers?
by 21eleven 6y ago
So it is more efficient at exploring the solution territory of traveling salesman type problems than classical computers?
- deleted 6y ago[deleted]
- reikonomusha 6y agoIt has not been shown that it solves QUBO/NP hard problems any faster asymptotically.
- pyk 6y agoI would safely say that it does not solve TSP faster than the best TSP code available - Concorde. More info here, and note there is an iOS app too (Concorde TSP on the App Store) that you can play with that solves TSP to optimality: http://www.math.uwaterloo.ca/tsp/concorde.html http://www.math.uwaterloo.ca/tsp/concorde.html