Given a list of cities and the distances between each pair of cities, how do you determine the shortest route that visits each city exactly once and returns to the starting location? This famous problem is called the 'traveling salesman problem' and is an example of a combinatorial optimization problem. Solving these problems using conventional computers can be very time-consuming, and special devices called 'quantum annealers' have been created for this purpose.