Solving the Traveling Salesman Problem on the D-Wave Quantum Computer

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 prese...

Full description

Bibliographic Details
Main Author: Jain, S. (Author)
Format: Article
Language:English
Published: Frontiers Media S.A. 2021
Subjects:
Online Access:View Fulltext in Publisher