Figure 1.
Quantum circuit to create a superposition of all permutations of 0, 1, 2, …, N − 1 for N = 4.
Figure 2.
Quantum circuit to augment terms like |0123〉 in ρ to |01122330〉 in σ for N = 4.
An Efficient Quantum Algorithm for the Traveling Salesman Problem
DOI: https://doi.org/10.2478/qic-2025-0004 | Journal eISSN: 3106-0544 (formerly 1533-7146) | 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.