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

[1]  Lov K. Grover,et al.  Synthesis of quantum superpositions by quantum computation , 2000, Physical review letters.

[2]  A. Carlini,et al.  Quantum Probabilistic Subroutines and Problems in Number Theory , 1999 .

[3]  G. Brassard.  Searching a Quantum Phone Book , 1997, Science.

[4]  Lov K. Grover,et al.  Nested quantum search and structured problems , 1998, quant-ph/9806078.

[5]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[7]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[8]  Raymond Laflamme,et al.  An Introduction to Quantum Computing , 2007, Quantum Inf. Comput..

[9]  Michael E. Saks,et al.  An improved exponential-time algorithm for k-SAT , 2005, JACM.

[10]  Christof Zalka zalka.  Using Grover’s quantum algorithm for searching actual databases , 2000 .

[11]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[12]  Colin P. Williams.  Quantum search algorithms in science and engineering , 2001, Comput. Sci. Eng..

[13]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[14]  Colin P. Williams,et al.  Fast Quantum Algorithms for Numerical Integrals and Stochastic Processes , 1999 .

[15]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.