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

@article{Heiligman2003QuantumAF, title={Quantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs}, author={M. Heiligman}, journal={arXiv: Quantum Physics}, year={2003} }

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

#### 7 Citations

Quantum computing approach for shortest route finding

- Mathematics, Computer Science
- East-West Design & Test Symposium (EWDTS 2013)
- 2013

Possible quantum algorithms for the Bollobas-Riordan-Tutte polynomial of a ribbon graph

- Mathematics, Engineering
- SPIE Defense + Commercial Sensing
- 2008

Solving the Network Shortest Path Problem on a Quantum Annealer

- Mathematics
- IEEE Transactions on Quantum Engineering
- 2020

#### References

SHOWING 1-5 OF 5 REFERENCES

E-mail address: miheili@nsa.gov

- E-mail address: miheili@nsa.gov