Now showing items 1-2 of 2
The structure of promises in quantum speedups
(Massachusetts Institute of Technology, 2014)
It has long been known that in the usual black-box model, one cannot get super-polynomial quantum speedups without some promise on the inputs. In this thesis, we examine certain types of symmetric promises, and show that ...
Quantum speedups in query complexity
(Massachusetts Institute of Technology, 2017)
In this thesis, we study randomized and quantum algorithms in the query complexity model. We investigate when and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query ...