Citation
Abstract
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 nonclassical algorithms and design the various phases of the probabilistic quantumclassical algorithm for classical and quantum parts. Finally, we represent the result of implementing and simulating Dijkstra's algorithm as the probabilistic quantumclassical algorithm.
Download File
Full text not available from this repository.

Additional Metadata
Item Type:  Article 

Subject:  Routers (Computer networks). 
Subject:  Graph theoryData processing. 
Subject:  Computer networks. 
Divisions:  Faculty of Computer Science and Information Technology 
Keywords:  Graph theory; algorithm design; quantum algorithm; network routing. 
Depositing User:  Umikalthom Abdullah 
Date Deposited:  24 Nov 2011 08:01 
Last Modified:  24 Nov 2011 08:01 
URI:  http://psasir.upm.edu.my/id/eprint/12706 
Statistic Details:  View Download Statistic 
Actions (login required)
View Item 