Prominent Quantum Computing Use Evaporates
A group of physicists argues that one of the most-often used examples for the use of quantum computers --- solving the travelling-salesman problem --- is a futile attempt. They reviewed two decades of failed attempts to force the problem into a form where a quantum computer would have an advantage, and suggest it is better to stick with classical or hybrid classical-quantum systems. They write:
“In terms of the question of whether there is evidence that purely quantum approaches (as opposed to hybrid quantum-classical approaches) can solve even small-sized TSPs, this article has reviewed two decades of literature to conclude there is little cause for optimism.”
The traveling salesman problem is the task of finding the shortest route among a number of given locations. Closely related problems need to be solved in many every-day routines, from logistics to finance to 3d printing. For this reason, the traveling salesman problem has become the traveling sales pitch of quantum computers.
Paper link in next tweet because of Elon's stupid algorithm