Probability and entanglement evolutions for Szegedy’s quantum search on the one-dimensional cycle with self-loops

Abstract

The Szegedy’s quantum walk can give rise to a quadratic speed-up when the Markov chain is ergodic and symmetric. However, the quantum search on a one-dimensional (1D) cycle graph does not achieve a speed-up. In this paper, we study the effects of self-loops on the 1D cycle by Szegedy’s quantum search. First, with the help of self-loops, Szegedy’s quantum search can increase the success probability of finding a marked vertex on the 1D cycle. Second, the general expressions for the evolving states and the success probability on the 1D cycle with self-loops are explicitly presented by the symmetric tridiagonal matrix. The evolution of success probability is slower and smaller with the increase in the weight of the self-loops. Third, an approximate entanglement formula of the success probability is derived by a concave function, where the entanglement is measured by the reduced von Neumann entropy. The existence of a turning point is confirmed, and it was found to depend on the maximum eigenvalue of the initial superposition state and the number of marked vertices. Before the turning point, the entanglement first increased and then decreased.