Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks

Stefan Boettcher, Shanshan Li, Tharso D. Fernandes +1

We establish a lower bound concerning the computational complexity of Grover's algorithms on fractal networks. This bound provides general predictions for the quantum advantage gai…