Browsing Mathematics (Faculty of) by Subject "quantum query complexity"
Now showing items 1-2 of 2
-
Lower Bounds on Quantum Query and Learning Graph Complexities
(University of Waterloo, 2014-07-22)In this thesis we study the power of quantum query algorithms and learning graphs; the latter essentially being very specialized quantum query algorithms themselves. We almost exclusively focus on proving lower bounds for ... -
Variants of Pseudo-deterministic Algorithms and Duality in TFNP
(University of Waterloo, 2023-08-18)We introduce a new notion of ``faux-deterministic'' algorithms for search problems in query complexity. Roughly, for a search problem $\cS$, a faux-deterministic algorithm is a probability distribution $\mathcal{A}$ over ...