In this paper, we will study the recurrence and localization exponents for quantum random walks on Sierpinski gaskets. In quantum computing, quantum algorithms have shown speed ups over their classical counterpart. One of the most celebrated examples is Shor's factorization algorithm that shows exponential speed up over the classical algorithm [1]}. For unsorted database search, Grover's quantum search algorithm has shown \(O(\sqrt{N})\)  speed up over the classical algorithm of \(O(N)\)  [2]}. Classical random walks have been used for spatial search. For quantum spatial search, quantum random walks were introduced by Aharanov, Davidovich, and Zagury [3]} as the quantum version of classical random walks. Since quantum random walks spread out ballistically, which is faster than the diffusive behavior of classical random walks, one generally expects quantum spatial search algorithm also has a speed up over the classical counterpart when quantum random walks are used for the search.
