A quantum algorithm for finding length of shortest path in the connected weighted graph
Mir Shahriar Emami, M. Tabasi, Hossein Keshmiri · International Conference on Parallel and Distributed Computing and Networks · 2008
In this paper we are going to discuss on the Quantum Computation approach and then we present a Quantum Algorithm for finding the estimation of the shortest path length between two vertices in a connected weighted graph with a polynomial time complexity O(n) whereas this problem based on the classic algorithm can be solved with time complexity about O(n2 -n).