Adapting the traveling salesman problem to an adiabatic quantum computer

Authors:
Richard H. Warren
Affiliations:
Lockheed Martin Corporation, King of Prussia, USA 19406 and , Glen Mills, USA 19342
Venue:
Quantum Information Processing
Year:
2013

Citing 3
Cited 0

Special cases of the traveling salesman problem

Applied Mathematics and Computation
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Investigating the performance of an adiabatic quantum optimization processor

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

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.