22 citations · 69 across the 8 of their papers we have counts for
Showing cond-mat.stat-mechShow all
2 papers · 1 filter
cond-mat.stat-mech2017★ 7 cited
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…
cond-mat.stat-mech2015★ 9 cited
Real-Space Renormalization Group for Spectral Properties of Hierarchical Networks
Stefan Boettcher, Shanshan Li
We derive the determinant of the Laplacian for the Hanoi networks and use it to determine their number of spanning trees (or graph complexity) asymptotically. While spanning trees…