EurekAlert March 3, 2020
Complex networks form the basis of various applications in virtually all fields of science. To analyze and manipulate these networks, specific “search” algorithms are required. But conventional search algorithms are slow and, when dealing with large networks, require a long computational time. To develop more efficient quantum algorithms researchers in Japan performed numerical simulations on some basic fractal lattices to try to find out the relationship between the number of vertices and the optimal computational time in a quantum walk search. They confirmed that the scaling law for some fractal lattices varied according to their spectral dimension, and the scaling law for another type of fractal lattice depends on a combination of its intrinsic characteristics, showing that the previous conjecture on the optimal number of oracle calls might be accurate. They expect that with their findings quantum searches will become easier to analyze experimentally…read more. TECHNICAL ARTICLE
Digging deeper into the intricacies of these networks to develop more efficient Quantum Algorithms. Credit: Tokyo University of Science