Query-to-communication lifting for BPP
Abstract
For any n-bit boolean function f, we show that the randomized communication complexity of the composed function f \circ gn, where g is an index gadget, is characterized by the randomized decision tree complexity of f. In particular, this means that many query complexity separations involving randomized models (e.g., classical vs. quantum) automatically imply analogous separations in communication complexity.
Publication Title
SIAM Journal on Computing
Recommended Citation
Goos, M., Pitassi, T., & Watson, T. (2020). Query-to-communication lifting for BPP. SIAM Journal on Computing, 49 (4), 441-461. https://doi.org/10.1137/17M115339X
COinS
