1 problem

Consider spatial search in a $d$-dimensional lattice with $N$ sites, and let $t_2$ be the number of times the oracle is called. Patel–Raghunathan lower-bound conjecture. The search…