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...
Saved in:
Main Authors: | , , , |
---|---|
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/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.upm.eprints.69245 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.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 |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
language |
English |
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. |
format |
Conference or Workshop Item |
author |
Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin |
spellingShingle |
Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin A quantum algorithm for minimal spanning tree |
author_facet |
Aghaei, Mohammad Reza Soltan Ahmad Zukarnain, Zuriati Mamat, Ali Zainuddin, Hishamuddin |
author_sort |
Aghaei, Mohammad Reza Soltan |
title |
A quantum algorithm for minimal spanning tree |
title_short |
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_sort |
quantum algorithm for minimal spanning tree |
publisher |
IEEE |
publishDate |
2008 |
url |
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/ |
_version_ |
1643839437856047104 |
score |
13.18916 |