33 citations · 71 across the 4 of their papers we have counts for
4 papers
Adversary lower bounds in the Hamiltonian oracle model
David Yonge-Mallo
In this note, we show that quantum lower bounds obtained using the adversary method hold in the Hamiltonian oracle model.
Efficient discrete-time simulations of continuous-time quantum query algorithms
R. Cleve, D. Gottesman, M. Mosca +2
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in tim…
Quantum Algorithms for Evaluating MIN-MAX Trees
Richard Cleve, Dmytro Gavinsky, David L. Yonge-Mallo
We present a bounded-error quantum algorithm for evaluating Min-Max trees. For a tree of size N our algorithm makes N^{1/2+o(1)} comparison queries, which is close to the optimal c…
Discrete-query quantum algorithm for NAND trees
Andrew M. Childs, Richard Cleve, Stephen P. Jordan +1
Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for evaluating NAND trees that runs in time O(sqrt(N log N)) in the Hamiltonian query model. In this note, we point…