Can quantum communication speed up distributed computation?

DOI10.1145/2611462.2611488zbMath1321.68072arXiv1207.5211OpenAlexW2101014999WikidataQ58040187 ScholiaQ58040187MaRDI QIDQ2943619

Hartmut Klauck, Michael Elkin, Danupon Nanongkai, Gopal Pandurangan

Publication date: 3 September 2015

Published in: Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

lower boundgraph algorithmstime complexitydistributed computingquantum communicationcongest model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Unnamed Item ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time

This page was built for publication: Can quantum communication speed up distributed computation?