Abstract
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.
Similar content being viewed by others
References
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)
Cao Z., Elgart A.: On the efficiency of Hamiltonian-based quantum computation for low-rank matrices. J. Math. Phys. 53, 032201 (2012)
Cook W.J.: In Pursuit of the Traveling Salesman. Princeton University Press, Princeton (2012)
Davenport, D.M., et al.: Quantum computing is here to stay. Lockheed Martin poster report at NASA meeting (September, 2011)
Hopfield J.J., Tank D.W.: Neural computation of decisions in optimization problems. Biol. Cybernet. 52, 141–152 (1985)
Karimi K. et al.: Investigating the performance of an adiabatic quantum optimization processor. Quantum Inf. Process. 11, 77–88 (2012)
Kochenberger G.A. et al.: A unified modeling and solution framework for combinatorial optimization problems. OR Spectr. 26, 237–250 (2004)
Laporte G.: A concise guide to the traveling salesman problem. J. Oper. Res. Soc. 61, 35–40 (2010)
Warren R.H.: Special cases of the traveling salesman problem. Appl. Math. Comput. 60, 171–177 (1994)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Warren, R.H. Adapting the traveling salesman problem to an adiabatic quantum computer. Quantum Inf Process 12, 1781–1785 (2013). https://doi.org/10.1007/s11128-012-0490-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11128-012-0490-8