3 citations · 3 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2001
Lower bounds in the quantum cell probe model
Pranab Sen, S. Venkatesh
We introduce a new model for studying quantum data structure problems -- the "quantum cell probe model". We prove a lower bound for the static predecessor problem in the address-on…
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…