In this paper, we study quantum algorithms for computing the exact value...
Motivated by the quantum speedup for dynamic programming on the Boolean
...
We study the quantum query complexity of two problems.
First, we consi...
Motivated by cryptographic applications such as predicate encryption, we...
We investigate the relation between the block sensitivity bs(f) and
frac...
In this paper we study quantum algorithms for NP-complete problems whose...
We show that all known classical adversary lower bounds on randomized qu...
Let f:{0,1}^n →{0,1} be a Boolean function. The certificate
complexity C...