Motivated by the quantum speedup for dynamic programming on the Boolean
...
A quantum walk algorithm can detect the presence of a marked vertex on a...
In this paper we study quantum algorithms for NP-complete problems whose...
We show that all known classical adversary lower bounds on randomized qu...
share