Emergent Properties of Quantum Search and Networks―Scaling Exponents in Fractal Lattices

Abstract

Emergent properties of quantum search and networks have attracted much attention recently. A quantum search is a faster search algorithm than a classical linear search. In real complex networks, we can find not only scale-free or small-world properties but also fractal properties. In this article, we report recent progress on the quantum search on the fractal lattice, especially on scaling exponents in optimal/effective numbers of the oracle call.