Quantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs

Simple item page
dc.creatorHeiligman, Mark
dc.date2003-03-20
dc.date.accessioned2026-07-07T06:06:24Z
dc.date.available2026-07-07T06:06:24Z
dc.descriptionQuantum algorithms for several problems in graph theory are considered. Classical algorithms for finding the lowest weight path between two points in a graph and for finding a minimal weight spanning tree involve searching over some space. Modification of classical algorithms due to Dijkstra and Prim allows quantum search to replace classical search and leads to more efficient algorithms. In the case of highly asymmetric complete bipartite graphs, simply replacing classical search with quantum search leads to a faster quantum algorithm. A fast quantum algorithm for computing the diameter of a complete graph is also given.
dc.description9 pages, to be submitted
dc.identifierhttps://arxiv.org/abs/quant-ph/0303131
dc.identifierhttp://arxiv.org/abs/quant-ph/0303131
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90960
dc.subjectQuantum Physics
dc.titleQuantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs
dc.typetext

Files

Collections

arXiv