|
| related topics |
| {information, entropy, channel} |
|
Quantum Floyd-Warshall Alorithm
A. S. Gupta, A. Pathak
abstract: 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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0502144
- categories:
- quant-ph
- comments:
- 6 pages, no figure
- arxiv_id:
- quant-ph/0502144
- created:
- 2005-02-23
Full article ▸
|
|
| related documents |
| 0612033v1 |
| 0606242v3 |
| 0105014v2 |
| 0507024v1 |
| 0104007v2 |
| 0005087v2 |
| 0002009v1 |
| 0209139v1 |
| 9908090v3 |
| 0406146v1 |
| 0001034v1 |
| 9811027v1 |
| 0703193v2 |
| 0507194v1 |
| 0007101v4 |
| 0209059v1 |
| 9912076v4 |
| 9706023v1 |
| 0406121v1 |
| 9704025v1 |
| 0206078v1 |
| 9709034v1 |
| 0312096v2 |
| 9608003v1 |
| 0011043v1 |
|