research
∙
02/16/2022
Quantum speedups for treewidth
In this paper, we study quantum algorithms for computing the exact value...
share
research
∙
04/29/2021
Quantum speedups for dynamic programming on n-dimensional lattice graphs
Motivated by the quantum speedup for dynamic programming on the Boolean ...
research
∙
07/06/2020
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
We study the quantum query complexity of two problems. First, we consi...
research
∙
10/04/2018
On the Inner Product Predicate and a Generalization of Matching Vector Families
Motivated by cryptographic applications such as predicate encryption, we...
research
∙
10/04/2018
On Block Sensitivity and Fractional Block Sensitivity
We investigate the relation between the block sensitivity bs(f) and frac...
research
∙
07/13/2018
Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
In this paper we study quantum algorithms for NP-complete problems whose...
research
∙
09/26/2017
All Classical Adversary Methods are Equivalent for Total Functions
We show that all known classical adversary lower bounds on randomized qu...
research
∙
08/02/2017
