activity
20002008
most citedA direct sum theorem in communication complexity via message compression

23 citations · 70 across the 7 of their papers we have counts for

collaborators
Showing 2008 · cs.DCShow all

1 paper · 2 filters

cs.DC2008★ 20 cited

Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity

Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan

We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f subset of X x Y x Z. We show: Q^{1,pub}(f^m) = Omega(m Q…