A direct sum theorem in communication complexity via message compression

Abstract

We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols. Our proofs use the notion of information cost of a protocol, as defined by Chakrabarti, Shi, Wirth and Yao and refined further by Bar-Yossef, Jayram, Kumar and Sivakumar. Our main technical result is a `compression' theorem saying that, for any probability distribution $\mu$ over the inputs, a $k$-round private coin bounded error protocol for a function $f$ with information cost $c$ can be converted into a $k$-round deterministic protocol for $f$ with bounded distributional error and communication cost $O(kc)$. We prove this result using a substate theorem about relative entropy and a rejection sampling argument. Our direct sum result follows from this `compression' result via elementary information theoretic arguments. We also consider the direct sum problem in quantum communication. Using a probabilistic argument, we show that messages cannot be compressed in this manner even if they carry small information. Hence, new techniques may be necessary to tackle the direct sum problem in quantum communication.

21 pages. Full version of a paper to appear at ICALP 2003

References in corpus (1)

• Quantum Circuits with Mixed States

Cited by in corpus (11)

• Lower bounds on information complexity via zero-communication protocols and applications
• Information Equals Amortized Communication
• Exponential Separation of Quantum Communication and Classical Information
• A unified approach to source and message compression
• Tension Bounds for Information Complexity
• Information Complexity versus Corruption and Applications to Orthogonality and Gap-Hamming
• Lower bounds for predecessor searching in the cell probe model
• Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma
• Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound
• A near-optimal direct-sum theorem for communication complexity
• Improved direct sum theorem in classical communication complexity