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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/69245/ http://psasir.upm.edu.my/id/eprint/69245/1/A%20quantum%20algorithm%20for%20minimal%20spanning%20tree.pdf |
| _version_ | 1848856350957764608 |
|---|---|
| author | Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin |
| author_facet | Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin |
| author_sort | Aghaei, Mohammad Reza Soltan |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T11:40:16Z |
| format | Conference or Workshop Item |
| id | upm-69245 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T11:40:16Z |
| publishDate | 2008 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-692452019-06-12T07:38:33Z http://psasir.upm.edu.my/id/eprint/69245/ A quantum algorithm for minimal spanning tree Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin 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. IEEE 2008 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/69245/1/A%20quantum%20algorithm%20for%20minimal%20spanning%20tree.pdf Aghaei, Mohammad Reza Soltan and Ahmad Zukarnain, Zuriati and Mamat, Ali and Zainuddin, Hishamuddin (2008) A quantum algorithm for minimal spanning tree. In: 3rd International Symposium on Information Technology (ITSim'08), 26-28 Aug. 2008, Kuala Lumpur, Malaysia. . 10.1109/ITSIM.2008.4632038 |
| spellingShingle | Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin A quantum algorithm for minimal spanning tree |
| title | A quantum algorithm for minimal spanning tree |
| title_full | A quantum algorithm for minimal spanning tree |
| title_fullStr | A quantum algorithm for minimal spanning tree |
| title_full_unstemmed | A quantum algorithm for minimal spanning tree |
| title_short | A quantum algorithm for minimal spanning tree |
| title_sort | quantum algorithm for minimal spanning tree |
| url | http://psasir.upm.edu.my/id/eprint/69245/ http://psasir.upm.edu.my/id/eprint/69245/ http://psasir.upm.edu.my/id/eprint/69245/1/A%20quantum%20algorithm%20for%20minimal%20spanning%20tree.pdf |