17 research outputs found
Query-to-Communication Lifting for BPP
For any -bit boolean function , we show that the randomized
communication complexity of the composed function , where is an
index gadget, is characterized by the randomized decision tree complexity of
. In particular, this means that many query complexity separations involving
randomized models (e.g., classical vs. quantum) automatically imply analogous
separations in communication complexity.Comment: 21 page
Exponential Separation between Quantum Communication and Logarithm of Approximate Rank
Chattopadhyay, Mande and Sherif (ECCC 2018) recently exhibited a total
Boolean function, the sink function, that has polynomial approximate rank and
polynomial randomized communication complexity. This gives an exponential
separation between randomized communication complexity and logarithm of the
approximate rank, refuting the log-approximate-rank conjecture. We show that
even the quantum communication complexity of the sink function is polynomial,
thus also refuting the quantum log-approximate-rank conjecture.
Our lower bound is based on the fooling distribution method introduced by Rao
and Sinha (ECCC 2015) for the classical case and extended by Anshu, Touchette,
Yao and Yu (STOC 2017) for the quantum case. We also give a new proof of the
classical lower bound using the fooling distribution method.Comment: The same lower bound has been obtained independently and
simultaneously by Anurag Anshu, Naresh Goud Boddu and Dave Touchett
Exponential separation between quantum communication and logarithm of approximate rank
Chattopadhyay, Mande and Sherif (ECCC 2018) recently exhibited a total Boolean function, the sink function, that has polynomial approximate rank and polynomial randomized communication complexity. This gives an exponential separation between randomized communication complexity and logarithm of the approximate rank, refuting the log-approximate-rank conjecture. We show that even the quantum communication complexity of the sink function is polynomial, thus also refuting the quantum log-approximate-rank conjecture. Our lower bound is based on the fooling distribution method introduced by Rao and Sinha (ECCC 2015) for the classical case and extended by Anshu, Touchette, Yao and Yu (STOC 2017) for the quantum case. We also give a new proof of the classical lower bound using the fooling distribution method.</p
KRW Composition Theorems via Lifting
One of the major open problems in complexity theory is proving
super-logarithmic lower bounds on the depth of circuits (i.e.,
). Karchmer, Raz, and Wigderson
(Computational Complexity 5(3/4), 1995) suggested to approach this problem by
proving that depth complexity behaves "as expected" with respect to the
composition of functions . They showed that the validity of this
conjecture would imply that .
Several works have made progress toward resolving this conjecture by proving
special cases. In particular, these works proved the KRW conjecture for every
outer function , but only for few inner functions . Thus, it is an
important challenge to prove the KRW conjecture for a wider range of inner
functions.
In this work, we extend significantly the range of inner functions that can
be handled. First, we consider the version of the KRW
conjecture. We prove it for every monotone inner function whose depth
complexity can be lower bounded via a query-to-communication lifting theorem.
This allows us to handle several new and well-studied functions such as the
-connectivity, clique, and generation functions.
In order to carry this progress back to the setting,
we introduce a new notion of composition, which
combines the non-monotone complexity of the outer function with the
monotone complexity of the inner function . In this setting, we prove the
KRW conjecture for a similar selection of inner functions , but only for a
specific choice of the outer function