Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks

The computation of the diameter is one of the most central problems in distributed computation. In the standard CONGEST model, in which two adjacent nodes can exchange O(log n) bits per round (here n denotes the number of nodes of the network), it is known that exact computation of the diameter requires Ω(n) rounds, even in networks with constant diameter. In this paper we investigate quantum distributed algorithms for this problem in the quantum CONGEST model, where two adjacent nodes can exchange O(log n) quantum bits per round. Our main result is a O(√D )-round quantum distributed algorithm for exact diameter computation, where D denotes the diameter. This shows a separation between the computational power of quantum and classical algorithms in the CONGEST model. We also show an unconditional lower bound Ω(√ ) on the round complexity of any quantum algorithm computing the diameter, and furthermore show a tight lower bound Ω(√D ) for any distributed quantum algorithm in which each node can use only poly(log n) quantum bits of memory.

[1]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[2]  Christoph Lenzen,et al.  Efficient distributed source detection with limited bandwidth , 2013, PODC '13.

[3]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[4]  Mehdi Mhalla,et al.  Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..

[5]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[6]  Alain Tapp,et al.  Can quantum mechanics help distributed computing? , 2008, SIGA.

[7]  Jaikumar Radhakrishnan,et al.  A lower bound for the bounded round quantum communication complexity of set disjointness , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[8]  Mark Braverman,et al.  Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[9]  Ronald de Wolf,et al.  Improved Quantum Communication Complexity Bounds for Disjointness and Equality , 2001, STACS.

[10]  Charles H. Bennett.  Time/Space Trade-Offs for Reversible Computation , 1989, SIAM J. Comput..

[11]  A. Razborov.  Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

[12]  François Le Gall.  Exponential Separation of Quantum and Classical Online Space Complexity , 2009 .

[13]  Adrian Kosowski,et al.  What Can Be Observed Locally? , 2009, DISC.

[14]  Hartmut Klauck,et al.  Can quantum communication speed up distributed computation? , 2012, PODC.

[15]  François Le Gall,et al.  Exponential separation of quantum and classical online space complexity , 2006, SPAA '06.

[16]  Keiji Matsumoto,et al.  Exact Quantum Algorithms for the Leader Election Problem , 2005, TOCT.

[17]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[18]  Andris Ambainis,et al.  Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[19]  David Peleg,et al.  Distributed Algorithms for Network Diameter and Girth , 2012, ICALP.

[20]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[21]  Roger Wattenhofer,et al.  Networks cannot compute their diameter in sublinear time , 2012, SODA.

[22]  Ronald de Wolf,et al.  Quantum communication and complexity , 2002, Theor. Comput. Sci..

[23]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[24]  Frédéric Magniez,et al.  Search via quantum walk , 2006, STOC '07.

[25]  Gilles Brassard,et al.  Quantum Counting , 1998, ICALP.

[26]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[27]  Gopal Pandurangan,et al.  Distributed quantum computing: a new frontier in distributed systems or science fiction? , 2008, SIGA.

[28]  Keren Censor-Hillel,et al.  Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks , 2016, DISC.

[29]  Karl Bringmann,et al.  A note on hardness of diameter approximation , 2017, Inf. Process. Lett..