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

A Hybrid Quantum-Classical Framework for the Travelling Salesman Problem via Adaptive DAG Decomposition and Grover-Based Sub-Tour Search

Amir Hameed Mir

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.13140/rg.2.2.33375.62881

Related papers

A Hybrid Quantum-Classical DAG-Based Decomposition Framework for the Traveling Salesman Problem

Amir Hameed Mir

•Jan 1, 2026•0 citations

A quantum-hybrid decomposition strategy for the traveling salesman problem in the plane

Dominik Leib, Susanne Fritzler, Tobias Seidel +1 more

•Jan 1, 2026•0 citations

Solving the Traveling Salesman Problem with a Hybrid Quantum-Classical Feedforward Neural Network

Justyna Zawalska, Katarzyna Rycerz

Lecture notes in computer science•Jan 1, 2023•4 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

Adapting the traveling salesman problem to an adiabatic quantum computer

Richard H. Warren

Quantum Information Processing•Sep 28, 2012•31 citations

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

Saweed Hussain, Lutfiana Sausan, Abdur Rahman +2 more

A hybrid quantum-classical framework is exploited to solve the Traveling Salesman Problem (TSP) based on a Quantum Approximate Optimization Algorithm (QAOA). To overcome the computational limitation of the Grover’s Search Algorithm (GSA) stemming from path encoding and arithmetic subroutines, a clustering-based strategy is employed to decompose a 16-city TSP into four 4-city subproblems, each of which can be solved with a 16-qubit budget. Intra-cluster solutions are optimized with QAOA, and are classically stitched to construct the global tour. Our results clearly validate the effectiveness of the hierarchical design of the algorithm, highlighting its feasibility for mid-scale quantum optimizations.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 14, 2025•0 citations
A hybrid quantum-classical framework is exploited to solve the Traveling Salesman Problem (TSP) based on a Quantum Approximate Optimization Algorithm (QAOA). To overcome the computational limitation of the Grover’s Search Algorithm (GSA) stemming from path encoding and arithmetic subroutines, a clustering-based strategy is employed to decompose a 16-city TSP into four 4-city subproblems, each of which can be solved with a 16-qubit budget. Intra-cluster solutions are optimized with QAOA, and are classically stitched to construct the global tour. Our results clearly validate the effectiveness of the hierarchical design of the algorithm, highlighting its feasibility for mid-scale quantum optimizations.