Mind the <inline-formula><math display="inline"><semantics><mrow><mover accent="true"><mi mathvariant="bold-script">O</mi><mo stretchy="false">˜</mo></mover></mrow></semantics></math></inline-formula>: 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 <inline-formula><math xmlns="http://...

Description complète

Détails bibliographiques

Auteurs principaux:	Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo, Eleanor G. Rieffel
Format:	Artigo
Langue:	Inglês
Publié:	MDPI AG 2023-07-01
Collection:	Algorithms
Sujets:	quantum computing distributed computing complexity Steiner tree directed minimum spanning tree arborescence
Accès en ligne:	https://www.mdpi.com/1999-4893/16/7/332
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!