A quantum algorithm for minimal spanning tree

• Main Authors: Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin
• Format: Conference or Workshop Item
• Language: English
• Published: IEEE 2008
• Online Access: http://psasir.upm.edu.my/id/eprint/69245/1/A%20quantum%20algorithm%20for%20minimal%20spanning%20tree.pdf; http://psasir.upm.edu.my/id/eprint/69245/

Quantum computing algorithms are considered for several problems in graph theory. Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. We modify classical Primpsilas algorithm and replace 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 Primpsilas algorithm in the probabilistic quantum-classical algorithm.