Quantum computers have achieved a major breakthrough by solving a math problem that has puzzled scientists for decades. The problem, known as the "Traveling Salesman Problem," involves finding the most efficient route for a salesman to visit a set of cities and return to the starting point.

It is a notoriously difficult problem to solve, even for the most powerful classical computers. However, a team of researchers using a quantum computer has found an optimal solution to the problem in record time.