Corpus ID: 15219629

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

  title={Quantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs},
  author={M. Heiligman},
  journal={arXiv: Quantum Physics},
  • M. Heiligman
  • Published 2003
  • Physics, Mathematics
  • arXiv: Quantum Physics
Quantum 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… Expand
Quantum computing approach for shortest route finding
  • V. Hahanov, V. Miz
  • Mathematics, Computer Science
  • East-West Design & Test Symposium (EWDTS 2013)
  • 2013
Quantum query complexity of graph connectivity
Possible quantum algorithms for the Bollobas-Riordan-Tutte polynomial of a ribbon graph
Mathematics on a Quantum Computer
Solving the Network Shortest Path Problem on a Quantum Annealer
Quantum computation beyond the circuit model
Quantum Computation Beyond the


A Quantum Algorithm for finding the Maximum
A Quantum Algorithm for Finding the Minimum
Algorithmic Graph Theory
Algorithmic graph theory
E-mail address:
  • E-mail address: