Adapting the traveling salesman problem to an adiabatic quantum computer
We show how to guide a quantum computer to select an optimal tour for the traveling salesman. This is significant because it opens a rapid solution method for the wide range of applications of the traveling salesman problem, which include vehicle routing, job sequencing and data clustering.
KeywordsTraveling salesman problem Adiabatic quantum computer Optimal tour
Unable to display preview. Download preview PDF.
- 1.Aharonov, D., et al.: Adiabatic quantum computation is equivalent to standard quantum computation. In: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, pp. 42–51 (2004)Google Scholar
- 4.Davenport, D.M., et al.: Quantum computing is here to stay. Lockheed Martin poster report at NASA meeting (September, 2011)Google Scholar