836 citations · 859 across the 3 of their papers we have counts for
Showing 1999Show all
2 papers · 1 filter
quant-ph1999
The query complexity of order-finding
Richard Cleve
We consider the problem where P is an unknown permutation on {0,1,...,2^n - 1}, y is an element of {0,1,...,2^n - 1}, and the goal is to determine the minimum r > 0 such that P^r(y…
cs.CC1999
Bounds for Small-Error and Zero-Error Quantum Algorithms
H. Buhrman, R. Cleve, R. de Wolf +1
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-o…