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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithms Jg. 16; H. 7; S. 332
Hauptverfasser:	Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo, Eleanor G. Rieffel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	MDPI AG 01.07.2023
Schlagworte:	arborescence complexity directed minimum spanning tree distributed computing quantum computing Steiner tree
ISSN:	1999-4893
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!