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

zbMATH Keywords

traveling salesman problemHamiltonian cycle problemefficient quantum algorithm

Mathematics Subject Classification ID

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

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)