A direct sum theorem in communication complexity via message compression

Details A direct sum theorem in communication complexity via message compression A direct sum theorem in communication complexity via message compression

2003-04-12

arxiv.org/abs/cs/0304020v2

Computer Science

Computational Complexity

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A direct sum theorem in communication complexity via message compression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A direct sum theorem in communication complexity via message compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A direct sum theorem in communication complexity via message compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462263