Citation
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. .
Abstract
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.
Download File
|
Additional Metadata
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Computer Science and Information Technology Institute for Mathematical Research |
| DOI Number: | https://doi.org/10.1109/ITSIM.2008.4632038 |
| Publisher: | IEEE |
| Keywords: | Quantum algorithm; Minimal spanning tree; Primpsilas algorithm |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 12 Jun 2019 07:38 |
| Last Modified: | 12 Jun 2019 07:38 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1109/ITSIM.2008.4632038 |
| URI: | http://psasir.upm.edu.my/id/eprint/69245 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |