Skip to main content
SpringerLink
Log in

Adapting the traveling salesman problem to an adiabatic quantum computer

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

  2. Cao Z., Elgart A.: On the efficiency of Hamiltonian-based quantum computation for low-rank matrices. J. Math. Phys. 53, 032201 (2012)

    Article  MathSciNet  ADS  Google Scholar 

  3. Cook W.J.: In Pursuit of the Traveling Salesman. Princeton University Press, Princeton (2012)

    MATH  Google Scholar 

  4. Davenport, D.M., et al.: Quantum computing is here to stay. Lockheed Martin poster report at NASA meeting (September, 2011)

  5. Hopfield J.J., Tank D.W.: Neural computation of decisions in optimization problems. Biol. Cybernet. 52, 141–152 (1985)

    MathSciNet  MATH  Google Scholar 

  6. Karimi K. et al.: Investigating the performance of an adiabatic quantum optimization processor. Quantum Inf. Process. 11, 77–88 (2012)

    Article  Google Scholar 

  7. Kochenberger G.A. et al.: A unified modeling and solution framework for combinatorial optimization problems. OR Spectr. 26, 237–250 (2004)

    Article  MATH  Google Scholar 

  8. Laporte G.: A concise guide to the traveling salesman problem. J. Oper. Res. Soc. 61, 35–40 (2010)

    Article  MATH  Google Scholar 

  9. Warren R.H.: Special cases of the traveling salesman problem. Appl. Math. Comput. 60, 171–177 (1994)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Author notes

  1. Richard H. Warren

    Present address: , 403 Bluebird Crossing, Glen Mills, PA, 19342, USA

Authors and Affiliations

  1. Lockheed Martin Corporation, 230 E. Mall Blvd., Bldg 100, King of Prussia, PA, 19406, USA

    Richard H. Warren

Authors
  1. Richard H. Warren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richard H. Warren.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-012-0490-8

Keywords

Search

Navigation