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

23 citations · 47 across the 5 of their papers we have counts for

collaborators
Showing quant-phShow all

5 papers · 1 filter

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-ph200410 cited

Quantum search for multiple items using parallel queries

Lov K. Grover, Jaikumar Radhakrishnan

In the quantum database search problem we are required to search for an item in a database. In this paper, we consider a generalization of this problem, where we are provided d ide…

quant-ph20044 cited

Is partial quantum search of a database any easier?

Lov K. Grover, Jaikumar Radhakrishnan

In this paper, we consider the partial database search problem where given a database on N items, we are required to determine the first k bits of an address x such that f(x)=1. We…

quant-ph20039 cited

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

quant-ph2000

The Quantum Complexity of Set Membership

Jaikumar Radhakrishnan, Pranab Sen, S. Venkatesh

We study the quantum complexity of the static set membership problem: given a subset S (|S| \leq n) of a universe of size m (m \gg n), store it as a table of bits so that queries o…