Quantum heuristic algorithm for traveling salesman problem
Quantum Physics
2013-01-08 v3
Abstract
We propose a quantum heuristic algorithm to solve a traveling salesman problem by generalizing Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with extremal costs, reaching almost to unity and they are shown characterized by statistical properties of tour costs. In particular for a Gaussian distribution of the tours along the cost we show that the quantum algorithm exhibits the quadratic speedup of its classical counterpart, similarly to Grover search.
Keywords
Cite
@article{arxiv.1004.4124,
title = {Quantum heuristic algorithm for traveling salesman problem},
author = {Jeongho Bang and Seokwon Yoo and James Lim and Junghee Ryu and Changhyoup Lee and Jinhyoung Lee},
journal= {arXiv preprint arXiv:1004.4124},
year = {2013}
}
Comments
Published version