33 citations · 71 across the 4 of their papers we have counts for
Showing 2007 · quant-phShow all
2 papers · 2 filters
quant-ph2007★ 3 cited
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…
quant-ph2007★ 33 cited
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…