Optimal quantum-walk search on Kronecker graphs with dominant or fixed regular initiators

Abstract

In network science, graphs obtained by taking the Kronecker or tensor power of the adjacency matrix of an initiator graph are used to construct complex networks. In this paper, we analytically prove sufficient conditions under which such Kronecker graphs can be searched by a continuoustime quantum walk in optimal Θ( √ N ) time. First, if the initiator is regular and its adjacency matrix has a dominant principal eigenvalue, meaning its unique largest eigenvalue asymptotically dominates the other eigenvalues in magnitude, then the Kronecker graphs generated by this initiator can be quantum searched with probability 1 in π √ N /2 time, asymptotically, and we give the critical jumping rate of the walk that enables this. Second, for any fixed initiator that is regular, non-bipartite, and connected, the Kronecker graphs generated by it are quantum searched in Θ( √ N ) time. This greatly extends the number of Kronecker graphs on which quantum walks are known to optimally search. If the fixed, regular, connected initiator is bipartite, however, then search on its Kronecker powers is not optimal, but is still better than classical computer's O(N ) runtime if the initiator has more than two vertices.

Optimality of spatial search via continuous-time quantum walks

“…However for lattices of d ≤ 4, a full quadratic speedup is lost. Since then a plethora of results have been published exhibiting a O( √ n) running time of the Childs and Goldstone algorithm (henceforth referred to as the CG algorithm) on certain specific graphs [7][8][9][10][11][12][13][14][15][16]. Although we state the general framework of the CG algorithm in detail in Sec.…”

Noisy quantum computation modeled by quantum walk: universality without ancillas

“…Quantum walk models have been shown to have an advantage over classical random walk, with [21,22] and without [23][24][25][26][27][28][29][30][31][32] a black-box, a property which can be leveraged for developing quantum algorithms. The model opens the door for using well-developed tools in physics, such as scattering and localization, towards studying quantum computation, allowing for numerous algorithms and results [25,[33][34][35][36][37][38][39][40][41][42][43]. It also allows the experimental simulation of near-term quantum circuits in optical and atomic/ionic platforms [44][45][46][47][48][49][50][51][52][53][54].…”