DeepAI AI Chat
Log In Sign Up

Asymptotically Faster Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

by   Phillip A. Kerger, et al.

The CONGEST and CONGEST-CLIQUE models have been carefully studied to represent situations where the communication bandwidth between processors in a network is severely limited. Messages of only O(log(n)) bits of information each may be sent between processors in each round. The quantum versions of these models allow the processors instead to communicate and compute with quantum bits under the same bandwidth limitations. This leads to the following natural research question: What problems can be solved more efficiently in these quantum models than in the classical ones? Building on existing work, we contribute to this question in two ways. Firstly, we present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact directed minimum spanning tree, each of which uses Õ(n^1/4) rounds of communication and Õ(n^9/4) messages, where n is the number of nodes in the network. The algorithms thus achieve a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithmic frameworks with quantum subroutines. An existing framework for using distributed version of Grover's search algorithm to accelerate triangle finding lies at the core of the asymptotic speedup. Secondly, we carefully characterize the constants and logarithmic factors involved in our algorithms as well as related algorithms, otherwise commonly obscured by Õ notation. The analysis shows that some improvements are needed to render both our and existing related quantum and classical algorithms practical, as their asymptotic speedups only help for very large values of n.


page 1

page 2

page 3

page 4


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...

Distributed Computation in the Node-Congested Clique

The Congested Clique model of distributed computing, which was introduce...

What Can We Compute in a Single Round of the Congested Clique?

We study the computational power of one-round distributed algorithms in ...

A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique

In this paper, we show that the Minimum Spanning Tree problem can be sol...

Random Sampling Applied to the MST Problem in the Node Congested Clique Model

The Congested Clique model, proposed by Lotker et al. [SPAA'03, SICOMP'0...

Quantum Distributed Algorithms for Detection of Cliques

The possibilities offered by quantum computing have drawn attention in t...

Broadcasting Spanning Forests on a Multiple-Access Channel

The problem of finding a spanning forest of a graph in a distributed-pro...