Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks

DOI10.1145/3212734.3212744zbMath1428.68385arXiv1804.02917OpenAlexW2963017524MaRDI QIDQ5197698

François Le Gall, Frédéric Magniez

Publication date: 19 September 2019

Published in: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.02917

zbMATH Keywords

quantum computationgraph algorithmsdistributed algorithmsCongest model

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Unnamed Item

This page was built for publication: Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks