◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Radhakrishnan

8 papers hereh-index 323.4k citations125 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author3
  • last author3

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • quant-ph5
  • cond-mat.stat-mech1
  • cs.CC1
  • cs.DM1

identity via Semantic Scholar / OpenAlex

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 2004 · quant-phShow all

2 papers · 2 filters

quant-ph2004★ 10 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-ph2004★ 4 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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.