On the Composition of Randomized Query Complexity and Approximate Degree
Preprint
Abstract
For any Boolean functions $f$ and $g$, the question whether $R(f\circ g) = \tilde{\Theta}(R(f)R(g))$, is known as the composition question for the randomized query complexity. Similarly, the composition question for the approximate degree asks whether $\widetilde{deg}(f\circ g) = \tilde{\Theta}(\widetilde{deg}(f)\cdot\widetilde{deg}(g))$. These questions are two of the most important and well-studied problems, and yet we are far from answering them satisfactorily. It is known that the measures compose if one assumes various properties of the outer function $f$ (or inner function $g$). This paper extends the class of outer functions for which $\text{R}$ and $\widetilde{\text{deg}}$ compose. A recent landmark result (Ben-David and Blais, 2020) showed that $R(f \circ g) = \Omega(noisyR(f)\cdot R(g))$. This implies that composition holds whenever $noisyR(f) = \Tilde{\Theta}(R(f))$. We show two results: (1)When $R(f) = \Theta(n)$, then $noisyR(f) = \Theta(R(f))$. (2) If $\text{R}$ composes with respect to an outer function, then $\text{noisyR}$ also composes with respect to the same outer function. On the other hand, no result of the type $\widetilde{deg}(f \circ g) = \Omega(M(f) \cdot \widetilde{deg}(g))$ (for some non-trivial complexity measure $M(\cdot)$) was known to the best of our knowledge. We prove that $\widetilde{deg}(f\circ g) = \widetilde{\Omega}(\sqrt{bs(f)} \cdot \widetilde{deg}(g)),$ where $bs(f)$ is the block sensitivity of $f$. This implies that $\widetilde{\text{deg}}$ composes when $\widetilde{\text{deg}}(f)$ is asymptotically equal to $\sqrt{\text{bs}(f)}$. It is already known that both $\text{R}$ and $\widetilde{\text{deg}}$ compose when the outer function is symmetric. We also extend these results to weaker notions of symmetry with respect to the outer function.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Composition limits and separating examples for some boolean function complexity measuresCombinatorica, 2016
- Dual Lower Bounds for Approximate Degree and Markov-Bernstein InequalitiesLecture Notes in Computer Science, 2013
- Quantum Adversary (Upper) BoundLecture Notes in Computer Science, 2012
- Block sensitivity of minterm-transitive functionsTheoretical Computer Science, 2011
- Block sensitivity of weakly symmetric functionsTheoretical Computer Science, 2007
- Robust Polynomials and Quantum AlgorithmsTheory of Computing Systems, 2007
- On the Sensitivity of Cyclically-Invariant Boolean Functions2005
- Graph properties and circular functions: how low can quantum query complexity go?2004
- Sensitivity vs. block sensitivity of Boolean functionsCombinatorica, 1995
- On the degree of boolean functions as real polynomialscomputational complexity, 1994