The traveling-salesman problem is an iconic route-finding task, with applications from chip design to planning and logistics. Here the authors show that if the graph of cities to be visited is of low degree, a traveling salesman armed with a quantum satnav can find the best route quadratically faster than using any known classical method.
No takes yet. Share an insight, caveat, or question.
Linden et al. (2017) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: