Quantum Algorithms for Lowest Weight Paths and Spanning Trees in Complete Graphs
Mark Heiligman
Abstract
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 search leads to a faster quantum algorithm. A fast quantum algorithm for computing the diameter of a complete graph is also given.
Create a lesson
Related papers
Generative learning of time series with holographic quantum circuit sampling
Bingzhi Zhang, Matthew W. Lee, Tom Finke et al.
Entanglement detection in dynamical quantum systems
Xingjian Zhang, Jiayi Wu, Jue Xu et al.
Partial-coherence weak measurement of polarization qubits with a temporal pointer: theory and experiment
Shane P. Gervais, Lambert Giner
A complete classification of operator controllability for closed three-level quantum systems driven by a single control
Sergey Kuznetsov, Alexander Pechen
Entanglement generation from degeneracy breaking of superradiant Liouvillian steady states by local operations
Adam Burgess, Erik M. Gauger
Classical Communication Helps Single-Shot Quantum Compression
Omri Farber, Gilad Gour