Can quantum communication speed up distributed computation?

DOI10.1145/2611462.2611488MaRDI QIDQ2943619zbMATH OpenOpenAlexWikidataFDO

Authors Michael Elkin, Hartmut Klauck, 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

congest modeldistributed computinggraph algorithmslower boundquantum communicationtime complexity

Mathematics Subject Classification ID

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

Abstract: The focus of this paper is on {em quantum distributed} computation, where we investigate whether quantum communication can help in {em speeding up} distributed network algorithms. Our main result is that for certain fundamental network problems such as minimum spanning tree, minimum cut, and shortest paths, quantum communication {em does not} help in substantially speeding up distributed algorithms for these problems compared to the classical setting. In order to obtain this result, we extend the technique of Das Sarma et al. [SICOMP 2012] to obtain a uniform approach to prove non-trivial lower bounds for quantum distributed algorithms for several graph optimization (both exact and approximate versions) as well as verification problems, some of which are new even in the classical setting, e.g. tight randomized lower bounds for Hamiltonian cycle and spanning tree verification, answering an open problem of Das Sarma et al., and a lower bound in terms of the weight aspect ratio, matching the upper bounds of Elkin [STOC 2004]. Our approach introduces the {em Server model} and {em Quantum Simulation Theorem} which together provide a connection between distributed algorithms and communication complexity. The Server model is the standard two-party communication complexity model augmented with additional power; yet, most of the hardness in the two-party model is carried over to this new model. The Quantum Simulation Theorem carries this hardness further to quantum distributed computing. Our techniques, except the proof of the hardness in the Server model, require very little knowledge in quantum computing, and this can help overcoming a usual impediment in proving bounds on quantum distributed algorithms.

Recommendations

• Communication Links for Distributed Quantum Computation
• Efficient distributed quantum computing
• Expected Communication Cost of Distributed Quantum Tasks
• Mathematical Foundations of Computer Science 2003
• Can quantum discord increase in a quantum communication task?
• scientific article; zbMATH DE number 1512076
• Distributed measurement-based quantum computation
• Distributed quantum programming
• Distributed Quantum Programming
• Quantum computation: where does the speed-up come from?

Cited in

(9)

• Enhancing distributed functional monitoring with quantum protocols
• A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
• Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
• Quantum advantage for the LOCAL model in distributed computing
• Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
• Sublinear-time quantum computation of the diameter in CONGEST networks
• On the power of quantum distributed proofs
• Even-cycle detection in the randomized and quantum CONGEST model
• Distributed quantum proofs for replicated data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943619)