A Secure Quantum Technology for Smart Cities Using Travelling Salesman Problem (TSP)

Abstract

Modern computing techniques like quantum computing are based on the remarkable phenomena of quantum mechanics. With an increasing number of instances of quantum supremacy displaying that a programmable quantum device can overcome the challenge that no computer algorithm can solve in any reasonable amount of time being shown by Google, IBM, Honeywell, and other distinct positions where quantum computing research is being conducted, quantum computing has grown in significance in recent days. Ultimately, travelling salesman problem (TSP) method is used and gives additional constraints on the beginning and ending points of the routing path. Hence, the outcome collections demonstrate that it is possible to obtain a strong quality result that has significant real-world applications even though the samples show an increase in problem complexity.