Scattering quantum walk search algorithm on star graph

Abstract

Quantum walk is a typical quantum computing model which is receiving significant attention in recent years from theory researchers. In this paper, we prove that the two major formulations for discrete quantum walks, coined and scattering, are unitarily equivalent on star graph. We then propose a new quantum search algorithm on star graph based on the scattering quantum walk. It is shown that the temporal complexity of the algorithm is the same as that in Grover algorithm, but success probability is greater than that in Grover algorithm when the objects are more than one third of total items.