Abstract
We propose a quantum heuristic algorithm to solve the traveling salesman problem by generalizing the Grover search. Sufficient conditions are derived to greatly enhance the probability of finding the tours with the cheapest costs reaching almost to unity. These conditions are characterized by the statistical properties of tour costs and are shown to be automatically satisfied in the large-number limit of cities. In particular for a continuous distribution of the tours along the cost, we show that the quantum heuristic algorithm exhibits a quadratic speedup compared to its classical heuristic algorithm.
Similar content being viewed by others
References
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Springer, 1999).
P. W. Shor, SIAM J. Comput. 26, 1484 (1997).
L. K. Grover, Phys. Rev. Lett. 79, 325 (1997).
A. W. Harrow, A. Hassidim and S. Lloyd, Phys. Rev. Lett. 103, 150502 (2009).
A. M. Childs, Nat. Phys. 5, 861 (2009).
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, San Francisco, 1979).
P. W. Shor, J. ACM 50, 87 (2003).
T. Hogg and D. Portov, Inform. Sciences 128, 181 (2000).
T. Hogg, Phys. Rev. Lett. 80, 2473 (1998).
C. A. Trugenburger, New J. Phys. 4, 26 (2002).
L. K. Grover, Chaos, Soliton. Fract. 10, 1695 (1999).
S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, Science 220, 671 (1983).
M. Znidaric and M. Horvat, Phys. Rev. A 73, 022329 (2006).
E. Farhi, J. Goldstone, S. Gutmann and D. Nagaj, Int. J. Quantum Inf. 6, 503 (2008).
D. L. Applegate, R. E. Bixby, V. Chvátal and W. J. Cook,, The Traveling Salesman Problem: A Computational Study (Princeton University Press, 2006).
R. M. Karp, Oper. Res. Lett. 1, 49 (1982).
V. Cerny, Phys. Rev. A 48, 116 (1993).
E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren and D. Preda, Science 292, 472 (2001).
R. Martonak, G. E. Santoro and E. Tosatti, Phys. Rev. E 70, 057701 (2004).
C. Durr and P. Hoyer, e-print quant-ph/9607014 (1996).
J. Beardwood, J. H. Halton and J. M. Hammersley, Proc. Cambridge Philos. Soc. 55, 229 (1959).
N. Burgess and M. A. Moore, J. Phys. A: Math. Gen. 22, 4599 (1989).
D. Goswami, H. Karnick, P. Jain and H. K. Maji, arXiv:quant-ph/0411013 (2004).
P. Zanardi and M. Rasetti, Phys. Rev. Lett. 79, 3306 (1997).
B. P. Lanyon, T. J. Weinhold, N. K. Langford, J. L. O’Brien, K. J. Resch, A. Gilchrist and A. G. White, Phys. Rev. Lett. 100, 060504 (2008).
N. Schuch and J. Siewert, Phys. Rev. Lett. 91, 027902 (2003).
L. K. Grover, Phys. Rev. Lett. 80, 4329 (1998).
E. Biham, O. Biham, D. Biron, M. Grassl, D. A. Lidar and D. Shapira, Phys. Rev. A 63, 012310 (2000).
G. L. Long, Y. S. Li, W. L. Zhang and L. Niu, Phys. Lett. A 262, 27 (1999).
M. Dobšíček, G. Johansson, V. Shumeiko and G. Wendin, Phys. Rev. A 76, 030306 (2007).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bang, J., Ryu, J., Lee, C. et al. A quantum heuristic algorithm for the traveling salesman problem. Journal of the Korean Physical Society 61, 1944–1949 (2012). https://doi.org/10.3938/jkps.61.1944
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3938/jkps.61.1944