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

Bulletin of the American Physical Society

Improved mapping of the travelling salesman problem for quantum annealing

Matthias Troyer, Bettina Heim, Ethan Brown, D. Wecker

Published Mar 4, 2015• 0 citations
OpenAlex

Related papers

Solving the traveling salesman problem on a quantum annealer

Richard H. Warren

SN Applied Sciences•Dec 13, 2019•48 citations

Comparing Integer Encodings in QUBO for Quantum and Digital Annealing: The Travelling Salesman Problem

Philippe Codognet

Lecture notes in computer science•Jan 1, 2024•1 citation

Ansatz Optimization Using Simulated Annealing in Variational Quantum Algorithms for the Traveling Salesman Problem

Fabrizio Fagiolo, Nicolò Vescera

IEEE International Conference on Quantum Artificial Intelligence (QAI)•Nov 2, 2025•2 citations

The travelling salesman problem and adiabatic quantum computation: an algorithm

Tien D. Kieu

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

Steiner Traveling Salesman Problem with Quantum Annealing

Alessia Ciacco, Francesca Guerriero, Eneko Osaba

The Steiner Traveling Salesman Problem (STSP) is a variant of the classical Traveling Salesman Problem. The STSP involves incorporating steiner nodes, which are extra nodes not originally part of the required visit set but that can be added to the route to enhance the overall solution and minimize the total travel cost. Given the NP-hard nature of the STSP, we propose a quantum approach to address it. Specifically, we employ quantum annealing using D-Wave's hardware to explore its potential for solving this problem. To enhance computational feasibility, we develop a preprocessing method that effectively reduces the network size. Our experimental results demonstrate that this reduction technique significantly decreases the problem complexity, making the Quadratic Unconstrained Binary Optimization formulation, the standard input for quantum annealers, better suited for existing quantum hardware. Furthermore, the results highlight the potential of quantum annealing as a promising and innovative approach for solving the STSP.

arXiv:2504.02388•Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 14, 2025•7 citations
The Steiner Traveling Salesman Problem (STSP) is a variant of the classical Traveling Salesman Problem. The STSP involves incorporating steiner nodes, which are extra nodes not originally part of the required visit set but that can be added to the route to enhance the overall solution and minimize the total travel cost. Given the NP-hard nature of the STSP, we propose a quantum approach to address it. Specifically, we employ quantum annealing using D-Wave's hardware to explore its potential for solving this problem. To enhance computational feasibility, we develop a preprocessing method that effectively reduces the network size. Our experimental results demonstrate that this reduction technique significantly decreases the problem complexity, making the Quadratic Unconstrained Binary Optimization formulation, the standard input for quantum annealers, better suited for existing quantum hardware. Furthermore, the results highlight the potential of quantum annealing as a promising and innovative approach for solving the STSP.