Solving the Traveling Salesman Problem on the D-Wave Quantum Computer
Keyword(s):
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.
2010 ◽
Vol 1
(2)
◽
pp. 82-92
◽
1986 ◽
Vol 18
(5)
◽
pp. 514-515
◽
1998 ◽
Vol 01
(02n03)
◽
pp. 149-159
◽
1986 ◽
Vol 37
(5)
◽
pp. 535-536
2020 ◽
pp. 152-159
2020 ◽
Vol 18
(2)
◽
pp. 1035
2009 ◽
Vol 194
(1)
◽
pp. 39-50
◽