NASA NTRS · 20230002008
Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees
Abstract
We present two algorithms in the Quantum CONGEST- CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses O ̃(n1/4) rounds of communication and O ̃(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms, as well as related classical algorithms, revealing that advances are needed to render both practical.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Phillip Kerger, David E Bernal Neira, Eleanor Rieffel. Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees. https://ntrs.nasa.gov/citations/20230002008
Cite the original work for its findings. Save a collection to share your selection of sources.