Abstract
Given \( x,y\in \lbrace 0,1\rbrace ^n \), Set Disjointness consists in deciding whether \( x_i=y_i=1 \) for some index \( i \in [n] \). We study the problem of computing this function in a distributed computing scenario in which the inputs \( x \) and \( y \) are given to the processors at the two extremities of a path of length \( d \). Each vertex of the path has a quantum processor that can communicate with each of its neighbours by exchanging \( \operatorname{O}(\log n) \) qubits per round. We are interested in the number of rounds required for computing Set Disjointness with constant probability bounded away from \( 1/2 \). We call this problem “Set Disjointness on a Line”.
Set Disjointness on a Line was introduced by Le Gall and Magniez [14] for proving lower bounds on the quantum distributed complexity of computing the diameter of an arbitrary network in the CONGEST model. However, they were only able to provide a lower bound when the local memory used by the processors on the intermediate vertices of the path is severely limited. More precisely, their bound applies only when the local memory of each intermediate processor consists of \( \operatorname{O}(\log n) \) qubits.
In this work, we prove an unconditional lower bound of \( \widetilde{\Omega }\big (\sqrt [3]{n d^2}+\sqrt {n} \, \big) \) rounds for Set Disjointness on a Line with \( d + 1 \) processors. This is the first non-trivial lower bound when there is no restriction on the memory used by the processors. The result gives us a new lower bound of \( \widetilde{\Omega } \big (\sqrt [3]{n\delta ^2}+\sqrt {n} \, \big) \) on the number of rounds required for computing the diameter \( \delta \) of any \( n \)-node network with quantum messages of size \( \operatorname{O}(\log n) \) in the CONGEST model.
We draw a connection between the distributed computing scenario above and a new model of query complexity. In this model, an algorithm computing a bi-variate function \( f \) (such as Set Disjointness) has access to the inputs \( x \) and \( y \) through two separate oracles \( {\mathcal {O}}_x \) and \( {\mathcal {O}}_y \), respectively. The restriction is that the algorithm is required to alternately make \( d \) queries to \( {\mathcal {O}}_x \) and \( d \) queries to \( {\mathcal {O}}_y \), with input-independent computation in between queries. The model reflects a “switching delay” of \( d \) queries between a “round” of queries to \( x \) and the following “round” of queries to \( y \). The information-theoretic technique we use for deriving the round lower bound for Set Disjointness on a Line also applies to the number of rounds in this query model. We provide an algorithm for Set Disjointness in this query model with round complexity that matches the round lower bound stated above, up to a polylogarithmic factor. This presents a barrier for obtaining a better round lower bound for Set Disjointness on the Line. At the same time, it hints at the possibility of better communication protocols for the problem.
- [1] . 2003. Quantum search of spatial regions. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society, 200–209.
DOI: Google ScholarCross Ref
- [2] . 2016. Near-Linear lower bounds for distributed distance computations, even in sparse networks. In Proceedings of the 30th International Symposiumon Distributed Computing. and (Eds.). Lecture Notes in Computer Science, Vol. 9888. Springer Berlin Heidelberg, 29–42.
DOI: Google ScholarCross Ref
- [3] . 2019. Understanding quantum algorithms via query complexity. In Proceedings of the International Congress of Mathematicians. , , and (Eds.). World Scientific, 3265–3285.
DOI: Google ScholarCross Ref
- [4] . 2018. Near-Optimal bounds on the bounded-round quantum communication complexity of Disjointness. SIAM Journal on Computing 47, 6 (2018), 2277–2314.Google Scholar
Digital Library
- [5] . 1999. Bounds for small-error and zero-error quantum algorithms. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 358–368.Google Scholar
Cross Ref
- [6] . 2002. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science 288, 1 (2002), 21–43.Google Scholar
Digital Library
- [7] . 2010. The story of Set Disjointness. SIGACT News 41, 3 (
Sept. 2010), 59–85.Google ScholarDigital Library
- [8] . 2021. Quantum Computing: Lecture Notes. arXiv:1907.09415. Retrieved from https://arxiv.org/abs/1907.09415.Google Scholar
- [9] . 2012. Networks cannot compute their diameter in sublinear time. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 1150–1162.
DOI: Google ScholarDigital Library
- [10] . 2012. Optimal distributed all pairs shortest paths and applications. In Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, New York, NY, 355–364.
DOI: Google ScholarDigital Library
- [11] . 2003. A Lower Bound for Bounded Round Quantum Communication Complexity of Set Disjointness. arXiv:quant-ph/0303138v2. Retrieved from https://arxiv.org/abs/quant-ph/0303138v2.Google Scholar
- [12] . 2003. A lower bound for the bounded round quantum communication complexity of Set Disjointness. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, 220–229.Google Scholar
Digital Library
- [13] . 1993. Combinatorial Matrices. Retrieved Nov. 28, 2020 from http://www-cs-faculty.stanford.edu/~knuth/preprints.html#unpub.
Manuscript .Google Scholar - [14] . 2018. Sublinear-Time quantum computation of the diameter in CONGEST networks. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, New York, NY, 337–346.Google Scholar
Digital Library
- [15] . 2020. Quantum distributed complexity of Set Disjointness on a Line. In Proceedings of the 47th International Colloquium on Automata, Languages, and Programming. , , and (Eds.). Leibniz International Proceedings in Informatics, Vol. 168, 82:1–82:18.
DOI: Google ScholarCross Ref
- [16] . 2011. Search via quantum walk. SIAM Journal on Computing 40, 1 (2011), 142–164. Issue 1.Google Scholar
Digital Library
- [17] . 2000. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK.Google Scholar
- [18] . 2000. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics.Google Scholar
Digital Library
- [19] . 2012. Distributed algorithms for network diameter and girth. In Proceedings of the 39th International Colloquium on Automata, Languages, and Programming. , , , and (Eds.). Lecture Notes in Computer Science, Vol. 7392, Springer Berlin Heidelberg, 660–672.
DOI: Google ScholarDigital Library
- [20] . 2003. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics 67, 1 (2003), 145–159.Google Scholar
Cross Ref
- [21] . 2015. Quantum information complexity. In Proceedings of the 47th Annual ACM Symposium on Theory of Computing. ACM, New York, NY, 317–326.Google Scholar
Digital Library
- [22] . 2018. The Theory of Quantum Information. Cambridge University Press, Cambridge, UK.Google Scholar
Digital Library
- [23] . 1979. Some complexity questions related to distributive computing (Preliminary Report). In Proceedings of the 11th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, New York, NY, 209–213.Google Scholar
Digital Library
- [24] . 1993. Quantum circuit complexity. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, 352–361.Google Scholar
- [25] . 1999. Grover’s quantum searching algorithm is optimal. Physical Review A 60, 4 (
Oct. 1999), 2746–2751.Google ScholarCross Ref
Index Terms
Quantum Distributed Complexity of Set Disjointness on a Line
Recommendations
The Multiparty Communication Complexity of Set Disjointness
In the $k$-party set disjointness problem, the goal is to determine whether given subsets $S_1,S_2,\dots,S_k\subseteq\{1,2,\dots,n\}$ have empty intersection. We study this problem in the number-on-the-forehead model of communication, where the $i$th party ...
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
FOCS '03: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer ScienceWe show lower bounds in the multi-party quantum communication complexity model. In this model, there are t parties where the ith party has input X_i\subseteq \left[ n \right]. These parties communicate with each other by transmitting qubits to determine ...
Simplified lower bounds on the multiparty communication complexity of disjointness
CCC '15: Proceedings of the 30th Conference on Computational ComplexityWe show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/ 4k). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log2(n) + ...






Comments