Set membership with two classical and quantum bit probes

12/30/2021
by   Shyam Dhamapurkar, et al.
0

We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is x in S?" can be answered by making at most t probes into the bit string. Let s(m,n,t) be the minimum number of bits needed by any such scheme. We obtain new upper bounds for s(m,n,t=2), which match or improve all the previously known bounds. We also consider the quantum version of this problem and obtain improved upper bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/03/2018

Convex optimization using quantum oracles

We study to what extent quantum algorithms can speed up solving convex o...
research
01/14/2018

Algorithmic Polynomials

The approximate degree of a Boolean function f(x_1,x_2,...,x_n) is the m...
research
09/30/2018

Two new results about quantum exact learning

We present two new results about exact learning by quantum computers. Fi...
research
08/14/2018

Random noise increases Kolmogorov complexity and Hausdorff dimension

Consider a binary string x of length n whose Kolmogorov complexity is α ...
research
10/17/2017

On the bit-size of non-radical triangular sets

We present upper bounds on the bit-size of coefficients of non-radical l...
research
02/23/2012

Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions

In this article we present an Elitism Levels Traverse Mechanism that we ...
research
04/20/2020

S3Library: Automatically Eliminating C/C++ Buffer Overflow using Compatible Safer Libraries

Annex K of C11, bounds-checking interfaces, recently introduced a set of...

Please sign up or login with your details

Forgot password? Click here to reset