Soltan Aghaei, Mohammad Reza and Ahmad Zulkarnain, Zuriati and Mamat, Ali and Zainuddin, Hishamuddin (2009) A hybrid algorithm for finding shortest path in network routing. Journal of Theoretical and Applied Information Technology, 5 (3 ). pp. 360-365. ISSN 1992-8645
Full text not available from this repository.
Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. Any classical algorithm deterministic or probabilistic will clearly used O(N) steps since on the average it will measure a large fraction of N records. Quantum algorithm is the fastest possible algorithm that can do several operations simultaneously due to their wave like properties. This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. Also we proposed the structure for non-classical algorithms and design the various phases of the probabilistic quantum-classical algorithm for classical and quantum parts. Finally, we represent the result of implementing and simulating Dijkstra's algorithm as the probabilistic quantum-classical algorithm.
|Keyword:||Graph theory; algorithm design; quantum algorithm; network routing.|
|Subject:||Routers (Computer networks).|
|Subject:||Graph theory-Data processing.|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Deposited By:||Umikalthom Abdullah|
|Deposited On:||24 Nov 2011 08:01|
|Last Modified:||24 Nov 2011 08:01|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 24 Nov 2011 08:01.