Quantum annealing of the Traveling Salesman Problem
Disordered Systems and Neural Networks
2009-11-10 v1 Quantum Physics
Abstract
We propose a path-integral Monte Carlo quantum annealing scheme for the symmetric Traveling Salesman Problem, based on a highly constrained Ising-like representation, and we compare its performance against standard thermal Simulated Annealing. The Monte Carlo moves implemented are standard, and consist in restructuring a tour by exchanging two links (2-opt moves). The quantum annealing scheme, even with a drastically simple form of kinetic energy, appears definitely superior to the classical one, when tested on a 1002 city instance of the standard TSPLIB.
Cite
@article{arxiv.cond-mat/0402330,
title = {Quantum annealing of the Traveling Salesman Problem},
author = {Roman Martonak and Giuseppe E. Santoro and Erio Tosatti},
journal= {arXiv preprint arXiv:cond-mat/0402330},
year = {2009}
}
Comments
5 pages, 2 figures