A quantum algorithm for minimal spanning tree

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...

詳細記述

保存先:
書誌詳細
主要な著者: Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin
フォーマット: Conference or Workshop Item
言語:English
出版事項: IEEE 2008
オンライン・アクセス: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/
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!