2 citations · 3 across the 6 of their papers we have counts for
1 paper · 1 filter
Harry Buhrman, Ronald de Wolf
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In part…