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

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

Full description

Bibliographic Details
Main Authors: Phillip Kerger, David E. Bernal Neira, Zoe Gonzalez Izquierdo, Eleanor G. Rieffel
Format: Article
Language:English
Published: MDPI AG 2023-07-01
Series:Algorithms
Subjects:
quantum computing
distributed computing
complexity
Steiner tree
directed minimum spanning tree
arborescence
Online Access:https://www.mdpi.com/1999-4893/16/7/332

Internet

https://www.mdpi.com/1999-4893/16/7/332

Similar Items