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

Quantum Information Processing

Adapting the traveling salesman problem to an adiabatic quantum computer

Richard H. Warren

Published Sep 28, 2012• 31 citations
Publisher
DOI
10.1007/s11128-012-0490-8

Related papers

The travelling salesman problem and adiabatic quantum computation: an algorithm

Tien D. Kieu

arXiv:1801.07859•Quantum Information Processing•Feb 9, 2019•28 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

Quantum Algorithms for Solving the Traveling Salesman Problem

Florian Klug

•Jan 1, 2024•2 citations

The quantum mechanical solution of the traveling salesman problem

Hans R. Moser

Physica E Low-dimensional Systems and Nanostructures•Feb 1, 2003•11 citations

Solving the traveling salesman problem on a quantum annealer

Richard H. Warren

SN Applied Sciences•Dec 13, 2019•48 citations

Employing continuous quantum systems to solve optimization problems

Alexander Sauer, Sebastian Luhn, Jannes Weghake

At land, sea and in the air mobility and traffic management offer a vast amount of problems with a large potential of optimization with quantum computers, e.g. service scheduling, route planning, or path optimization. Many of these problems can be described at a fundamental level by the traveling salesman problem (TSP), in which the shortest route while visiting each point exactly once is to be found [1]. The TSP has already received a lot of attention in the quantum computing community, for example, implementations for adiabatic quantum annealers exist and have been tested [2,3]. We investigate the TSP with a focus on going beyond qubits by employing continuous quantum systems. Using bosonic Qiskit we simulate potential algorithms for solving the TSP and compare their performance. [1] Flood, M. M., The traveling-salesman problem. Operations research, 4(1), 61-75, (1956). [2] Martoňák, Roman, Giuseppe E. Santoro, and Erio Tosatti., Quantum annealing of the traveling-salesman problem. Physical Review E 70.5: 057701, (2004). [3] Jain, S., Solving the traveling salesman problem on the d-wave quantum computer. Frontiers in Physics, 646, (2021).

•Mar 13, 2024•0 citations
At land, sea and in the air mobility and traffic management offer a vast amount of problems with a large potential of optimization with quantum computers, e.g. service scheduling, route planning, or path optimization. Many of these problems can be described at a fundamental level by the traveling salesman problem (TSP), in which the shortest route while visiting each point exactly once is to be found [1]. The TSP has already received a lot of attention in the quantum computing community, for example, implementations for adiabatic quantum annealers exist and have been tested [2,3]. We investigate the TSP with a focus on going beyond qubits by employing continuous quantum systems. Using bosonic Qiskit we simulate potential algorithms for solving the TSP and compare their performance. [1] Flood, M. M., The traveling-salesman problem. Operations research, 4(1), 61-75, (1956). [2] Martoňák, Roman, Giuseppe E. Santoro, and Erio Tosatti., Quantum annealing of the traveling-salesman problem. Physical Review E 70.5: 057701, (2004). [3] Jain, S., Solving the traveling salesman problem on the d-wave quantum computer. Frontiers in Physics, 646, (2021).