A Framework for Distributed Quantum Queries in the CONGEST Model

DOI10.1145/3519270.3538413arXiv2202.10969WikidataQ130825659 ScholiaQ130825659MaRDI QIDQ6202012FDOQ6202012

Authors: Tijn de Vos 

Publication date: 26 March 2024

Published in: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Abstract: 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 $ildeO(sqrtkD+D)$ rounds, with $D$ the network diameter. We also give an algorithm for element distinctness: if all nodes together hold a list of $k$ numbers, they can find a duplicate in $ildeO(k^{2/3}{D}^{1/3}+D)$ 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(sqrtnD)$ 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 $epsilon$-additive approximation of the average eccentricity in $ildeO(D+D^{3/2}/epsilon)$ 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(k+(kn{)}^{1/2-1/Theta(k)})$ rounds. For girth computation we give an $ildeO(g+(gn{)}^{1/2-1/Theta(g)})$ round algorithm for graphs with girth $g$, beating the known classical lower bound.

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

zbMATH Keywords

girthelement distinctnesscycle detectiondistributed Deutsch-Jozsaquantum CONGEST

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

This page was built for publication: A Framework for Distributed Quantum Queries in the CONGEST Model

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