A QUANTUM IMPROVEMENT ON DIJKSTRA’S ALGORITHM FOR COMPUTER NETWORK ROUTING

Abstract

The aim of this paper is to improve the Dijkstra algorithm which is widely used in the internet routing. Quantum computing approach is used to improve the work of Dijkstra 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 the result shows that the quantum approach is better in finding the optimal path with better time complexity when it is implemented in quantum computer.

Keywords

• quantumcomputing
• routing algorithms
• computer network