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

Academia Letters

Are Symmetric Traveling Salesman Problems Well Suited to Benchmark Some Quantum Optimization Problems?

Richard H. Warren

Published Jan 13, 2022• 1 citation
Publisher
DOI
10.20935/al4635

Related papers

Tackling Traveling Salesman Problems with a Cluster-Based Quantum-Classical Optimization

Saweed Hussain, Hoon Ryu

KSII Transactions on Internet and Information Systems•May 31, 2026•0 citations

Quantum wavefunction optimization algorithm: application in solving traveling salesman problem

Pritpal Singh

International Journal of Machine Learning and Cybernetics•Dec 7, 2024•7 citations

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

Quantum-Circuit-Based Artificial Bee Colony Algorithm for Combinatorial Optimization: A Study on the Traveling Salesman Problem

Rohit Kumar Nonia, Mayukh Sarkar, Dilip Kumar Shaw

•Jan 1, 2026•0 citations

Quantum Algorithms for Solving the Traveling Salesman Problem

Florian Klug

•Jan 1, 2024•2 citations

A benchmark for quantum optimization: the traveling salesman

Richard H. Warren

We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.

Quantum Information and Computation•Apr 27, 2021•9 citations