1.4k citations · 4.4k across the 43 of their papers we have counts for
Showing 1996Show all
2 papers · 1 filter
quant-ph1996★ 6 cited
On The Power of Exact Quantum Polynomial Time
Gilles Brassard, Peter Hoyer
We investigate the power of quantum computers when they are required to return an answer that is guaranteed correct after a time that is upper-bounded by a polynomial in the worst…
quant-ph1996★ 354 cited
A Quantum Algorithm for Finding the Minimum
Christoph Durr, Peter Hoyer
We give a quantum algorithm to find the index y in a table T of size N such that in time O(c sqrt N), T[y] is minimum with probability at least 1-1/2^c.