Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1801.07859 · Quantum Information Processing

The travelling salesman problem and adiabatic quantum computation: an algorithm

Tien D. Kieu

Published Feb 9, 2019• 24 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2206-9

Related papers

Adapting the traveling salesman problem to an adiabatic quantum computer

Richard H. Warren

Quantum Information Processing•Sep 28, 2012•26 citations

Quantum Branch-and-Bound Algorithm and its Application to the Travelling Salesman Problem

E. A. Markevich, Anton Sergeevich Trushechkin

Journal of Mathematical Sciences•Jul 29, 2019•3 citations

Quantum Algorithms for Solving the Traveling Salesman Problem

Florian Klug

•Jan 1, 2024•2 citations

Study On Adaptive Quantum Algorithm In Traveling Salesman Problem

Liyuan Jia, HE Jian-xin, Chi Zhang

International Journal of Advancements in Computing Technology•Mar 15, 2013•0 citations

A Magnetism-Inspired Quantum Algorithm to Solve the Traveling Salesman Problem

Luke Ellert-Beck, Michael J. Lawler, Samuel Gosin

Bulletin of the American Physical Society•Mar 19, 2021•0 citations

Improved mapping of the travelling salesman problem for quantum annealing

Matthias Troyer, Bettina Heim, Ethan Brown +1 more

Bulletin of the American Physical Society•Mar 4, 2015•0 citations