By Topic

A Hybrid Algorithm for the Shortest-Path Problem in the Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Reza Soltan Aghaei, M. ; Dept. of Comput. Eng., Islamic Azad Univ. of Khorasgan, Isfahan, Iran ; Zukarnain, Z.A. ; Mamat, A. ; Zainuddin, H.

Quantum algorithms run on quantum computers are qualitatively different from those that run on classical computers. Quantum computing algorithms can be used for several problems in graph theory. Most of the classical algorithms involve searching over some space for finding the shortest-paths problem between two points in a graph and a minimal weight spanning tree. We modified classical Dijkstra's algorithm and implement quantum search instead of classical search, of which it will lead to more efficient algorithm. 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.

Published in:

Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on

Date of Conference:

20-22 Dec. 2008