An efficient quantum algorithm for the traveling salesman problem

DOI10.2478/QIC-2025-0004MaRDI QIDQ6874236zbMATH OpenFDO

Authors Anant Sharma, Nupur Deshpande, Sanchita Ghosh, Sreetama Das, Shibdas Roy

Publication date 15 January 2026

Published in Quantum Information \& Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.2478/QIC-2025-0004

zbMATH Keywords

efficient quantum algorithmHamiltonian cycle problemtraveling salesman problem

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• An Algorithm for the Traveling Salesman Problem
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• On the solution of traveling salesman problems
• Solution of a Large-Scale Traveling-Salesman Problem
• Solution of large-scale symmetric travelling salesman problems
• The traveling-salesman problem and minimum spanning trees: Part II
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm

This page was built for publication: An efficient quantum algorithm for the traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6874236)