Mind the : Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms

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 a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms Ročník 16; číslo 7; s. 332
Hlavní autoři: Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo, Eleanor G. Rieffel
Médium: Journal Article
Jazyk:angličtina
Vydáno: MDPI AG 01.07.2023
Témata:
arborescence
complexity
directed minimum spanning tree
distributed computing
quantum computing
Steiner tree
ISSN:1999-4893
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 algorithmic frameworks with quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms as well as related classical algorithms, otherwise obscured by O ˜ notation, revealing that advances are needed to render both the quantum and classical algorithms practical.
ISSN:1999-4893
DOI:10.3390/a16070332