Have a personal or library account? Click to login
An Efficient Quantum Algorithm for the Traveling Salesman Problem Cover

An Efficient Quantum Algorithm for the Traveling Salesman Problem

Open Access
|Feb 2025

Authors

Anant Sharma

anantsharma2410@gmail.com

Department of Physics, Université de Bourgogne, Dijon, France
Center for Quantum Engineering, Research and Education (CQuERE), TCG CREST, Kolkata, India

Nupur Deshpande

dnupur79@gmail.com

Department of Physics, Indian Institute of Science Education and Research (IISER), Tirupati, India

Sanchita Ghosh

sanchita.ghosh14@gmail.com

Center for Quantum Engineering, Research and Education (CQuERE), TCG CREST, Kolkata, India
Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, The Netherlands

Sreetama Das

sreetama@ifisc.uib-csic.es

Instituto de Física Interdisciplinar y Sistemas Complejos (IFISC), UIB-CSIC UIB Campus, Spain
Istituto Nazionale di Ottica del Consiglio Nazionale delle Ricerche (CNR-INO), Florence, Italy
European Laboratory for Non-Linear Spectroscopy (LENS), Sesto Fiorentino, Italy
Department of Physics and Astronomy, University of Florence, Sesto Fiorentino, Italy

Shibdas Roy

roy.shibdas@gmail.com

Center for Quantum Engineering, Research and Education (CQuERE), TCG CREST, Kolkata, India
Academy of Scientific and Innovative Research (AcSIR), Ghaziabad, India
DOI: https://doi.org/10.2478/qic-2025-0004 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
Language: English
Page range: 71 - 81
Submitted on: Nov 17, 2024
Accepted on: Feb 10, 2025
Published on: Feb 22, 2025
Published by: Cerebration Science Publishing Co., Limited
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:

© 2025 Anant Sharma, Nupur Deshpande, Sanchita Ghosh, Sreetama Das, Shibdas Roy, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.