31 citations · 199 across the 33 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
quant-ph2014
Quantum lower bound for inverting a permutation with advice
Aran Nayebi, Scott Aaronson, Aleksandrs Belovs +1
Given a random permutation as a black box and , we want to output . Supplementary to our input, we are given classical advice in the form…
quant-ph2014★ 9 cited
Applications of the Adversary Method in Quantum Query Algorithms
Aleksandrs Belovs
In the thesis, we use a recently developed tight characterisation of quantum query complexity, the adversary bound, to develop new quantum algorithms and lower bounds. Our results…