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

Full description

Bibliographic Details

Published in:	Algorithms Vol. 16; no. 7; p. 332
Main Authors:	Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo, Eleanor G. Rieffel
Format:	Journal Article
Language:	English
Published:	MDPI AG 01.07.2023
Subjects:	arborescence complexity directed minimum spanning tree distributed computing quantum computing Steiner tree
ISSN:	1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!