most citedA direct sum theorem in communication complexity via message compression

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

collaborators

7 papers

quant-ph2005

Resource requirements of private quantum channels and consequence for oblivious remote state preparation

Rahul Jain

Shannon in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically secure way. Amba…

quant-ph20051 cited

On divergence, relative entropy and the substate property

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

In this article we study relationship between three measures of distinguishability of quantum states called as divergence, relative entropy and the substate property.

quant-ph20054 cited

Distinguishing sets of quantum states

Rahul Jain

Given two sets finite and of quantum states. We show necessary and sufficient conditions for distinguishing them by a measurement.

cs.OH2005

Improved direct sum theorem in classical communication complexity

Rahul Jain

Withdrawn due to critical error.

quant-ph2005

Communication complexity of remote state preparation with entanglement

Rahul Jain

We consider the problem of remote state preparation recently studied in several papers. We study the communication complexity of this problem, in the presence of entanglement and i…

cs.CC200323 cited

A direct sum theorem in communication complexity via message compression

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

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 p…