The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem. Results of practical experiments are also presented using D-Wave’s 5,000 qubit Advantage 1.1 quantum annealer and the performance is compared to a classical solver. It is found the quantum annealer can only handle a problem size of 8 or less nodes and its performance is subpar compared to the classical solver both in terms of time and accuracy.
CITATION STYLE
Jain, S. (2021). Solving the Traveling Salesman Problem on the D-Wave Quantum Computer. Frontiers in Physics, 9. https://doi.org/10.3389/fphy.2021.760783
Mendeley helps you to discover research relevant for your work.