Solving traffic optimization problems is a tedious, hit$-$and$-$miss process. The "traveling salesman" problem is an example of this type of problem. It aims to determine the shortest possible route between multiple cities, hitting each city s$.$ Snce and returning to the starting point. This optimization problem is to handle.

incredibly difficult for quantum computers

incredibly easy for both quantum and classical computers

incredibly difficult for classical computers

incredibly easy for classical computers