23 citations · 36 across the 5 of their papers we have counts for
8 papers
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.
Lower bounds for predecessor searching in the cell probe model
Pranab Sen, S. Venkatesh
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form "What is t…
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…
A lower bound for bounded round quantum communication complexity of set disjointness
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
We consider the class of functions whose value depends only on the intersection of the input X_1,X_2, ..., X_t; that is, for each F in this class there is an f_F: 2^{[n]} \to {0,1}…
Quantum testers for hidden group properties
Katalin Friedl, Frederic Magniez, Miklos Santha +1
We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in t…
Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan
We consider the problem of computing the second elementary symmetric polynomial S^2_n(X) using depth-three arithmetic circuits of the form "sum of products of linear forms". We con…