Log In Sign Up

A Framework for Distributed Quantum Queries in the CONGEST Model

by   Joran van Apeldoorn, et al.

The Quantum CONGEST model is a variant of the CONGEST model, where messages consist of O(log(n)) qubits. We give a general framework for implementing quantum query algorithms in Quantum CONGEST, using the concept of parallel-queries. We apply our framework for distributed quantum queries in two settings: when data is distributed over the network, and graph theoretical problems where the network defines the input. The first is slightly unusual in CONGEST but our results follow almost directly. The second is more traditional for the CONGEST model but here we require some classical CONGEST steps to get our results. In the setting with distributed data, we show how a network can schedule a meeting in one of k dates using Õ(√(kD)+D) rounds, with D the network diameter. We also give an efficient algorithm for element distinctness: if all nodes are given numbers, then the nodes can find any duplicates in Õ(n^2/3D^1/3) rounds. We also generalize the protocol for the distributed Deutsch-Jozsa problem from the two-party setting considered in [arXiv:quant-ph/9802040] to general networks, giving a novel separation between exact classical and exact quantum protocols in CONGEST. When the input is the network structure itself, we almost directly recover the O(√(nD)) round diameter computation algorithm of Le Gall and Magniez [arXiv:1804.02917]. We also compute the radius in the same number of rounds, and give an ϵ-additive approximation of the average eccentricity in Õ(D+D^3/2/ϵ) rounds. Finally, we give quantum speedups for the problems of cycle detection and girth computation. We detect whether a graph has a cycle of length at most k in O(D+(Dn)^1/2-1/Θ(k)) rounds. We also give a Õ(D+(Dn)^1/2-1/Θ(g)) round algorithm for finding the girth g, beating the known classical lower bound.


page 1

page 2

page 3

page 4


Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks

The computation of the diameter is one of the most central problems in d...

Round elimination in exact communication complexity

We study two basic graph parameters, the chromatic number and the orthog...

Distributed Computing Made Secure: A New Cycle Cover Theorem

In the area of distributed graph algorithms a number of network's entiti...

Quantum Distributed Complexity of Set Disjointness on a Line

Given x,y∈{0,1}^n, Set Disjointness consists in deciding whether x_i=y_i...

Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model

The All-Pairs Shortest Path problem (APSP) is one of the most central pr...

Quantum Advantage for the LOCAL Model in Distributed Computing

There are two central models considered in (fault-free synchronous) dist...

Always be Two Steps Ahead of Your Enemy

We investigate the maintenance of overlay networks under massive churn, ...