arXiv · cond-mat/0402330
Quantum annealing of the Traveling Salesman Problem
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Roman Martonak, Giuseppe E. Santoro, Erio Tosatti. 2004-02-12. Quantum annealing of the Traveling Salesman Problem. https://doi.org/10.1103/physreve.70.057701
Cite the original work for its findings. Save a collection to share your selection of sources.