Year: 2025
Type: preprint
Abstract: Similarly to the Chomsky hierarchy, we offer a classification of communication complexity measures such that these measures are organized into equivalence classes. Different from previous attempts of this endeavor, we consider two communication complexity measures as equivalent, if, when one is constant, then the other is constant as well, and vice versa. Most previous considerations of similar topics have been using polylogarithmic input length as a defining characteristic of equivalence. In this paper, two measures ${\cal C}_1, {\cal C}_2$ are constant-equivalent, if and only if for all total Boolean (families of) functions $f:\{0, 1\}^n\times\{0, 1\}^n\rightarrow \{0, 1\}$ we have ${\cal C}_1(f)=O(1)$ if and only if ${\cal C}_2(f)=O(1)$. We identify five equivalence classes according to the above equivalence relation. Interestingly, the classification is counter-intuitive in that powerful models of communication are grouped with weak ones, and seemingly weaker models end up on the top of the hierarchy.
Source: arXiv (Cornell University)
Authors: Ambainis, Andris, Klauck, Hartmut, Lim, Debbie
Institutions: University of Latvia, Centre for Quantum Technologies
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G3250777904, G3969146329, G6437558859
OpenAlex ID: W7083843938
Cites:
Cited by:
Related to: