Where quantum computers can score
The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a team has shown that a certain class of such problems can actually be solved better and much faster with quantum computers than with conventional methods.
Read more: Where quantum computers can score
Story added 18. March 2024, content source with full text you can find at link above.