1.4k citations · 4.4k across the 43 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
quant-ph2005★ 53 cited
Lower Bounds on Quantum Query Complexity
Peter Hoyer, Robert Spalek
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classic…
quant-ph2005★ 13 cited
Tight adversary bounds for composite functions
Peter Hoyer, Troy Lee, Robert Spalek
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many…