Quantum Floyd-Warshall Alorithm

Details Quantum Floyd-Warshall Alorithm Quantum Floyd-Warshall Alorithm

2005-02-23

arxiv.org/abs/quant-ph/0502144v1

Physics

Quantum Physics

6 pages, no figure

Scientific paper

Classical Floyd-Warshall algorithm is used to solve all-pairs shortest path problem on a directed graph. The classical algorithm runs in \mathcal{O} (V^{3}) time where V represents the number of nodes. Here we have modified the algorithm and proposed a quantum algorithm analogous to Floyd-Warshall algorithm which exploits the superposition principle and runs in \mathcal{O} (Vlog_{2}V) time.

Affiliated with

Also associated with

No associations

Rating

Quantum Floyd-Warshall Alorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Floyd-Warshall Alorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Floyd-Warshall Alorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-399339