TY  - JOUR
T1  - A Quantum Based Algorithm for Computer Network Routing
AU - , Ahmed T. Sadik AU - , Rana F. Ghani 
JO  - Asian Journal of Information Technology
VL  - 6
IS  - 12
SP  - 1243
EP  - 1246
PY  - 2007
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2007.1243.1246
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2007.1243.1246
KW  - Quantum computing
KW  -Grover`s algorithm
KW  -Dijkstra’s algorithm
KW  -genetic algorithm
KW  -network routing
AB  - 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.
ER  -