The Traveling Salesman Problem is not just a curiosity. It’s a very important example of a class of problems of enormous practical significance, called combinatorial optimization.

A new approach to solving the ‘Travelling Salesperson Problem’ – one of the most difficult questions in computer science – significantly outperforms current approaches.

Quantum Algorithm Solves Travelling Salesperson Problem With 1-Qubit Quantum physicists have developed an algorithm that uses a single qubit to solve a problem that had previously needed thousands of ...