A Quantum Based Algorithm for Computer Network Routing

摘要

The aim of this study, is to design and implement a quantum algorithm for network routing by exploiting the massive parallelism existing in the quantum environment and to deal with the demands of continuous growing of the internet. This algorithm is compared according to the number of iterations and time complexity with Dijkstra?s algorithm and Genetic algorithm and the result shows that the quantum approach is better in finding the optimal path with less time complexity.