Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory

Abstract

We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical transport processes on graphs, and calculate the spacetime transition probabilities between two vertices of the lattice. Then we analytically show that there are two power law decays $\sim t^{-3}$ and $\sim t^{-1.5}$ at the beginning of the transport for transition probability in the continuous-time quantum and classical random walk respectively. This results illustrate the decay of quantum mechanical transport processes is quicker than that of the classical one. Due to the result, the characteristic time $t_c$, which is the time when the first maximum of the probabilities occur on an infinite graph, for the quantum walk is shorter than that of the classical walk. Therefore, we can interpret that the quantum transport speed on spidernet is faster than that of the classical one. In the end, we investigate the results by numerical analysis for two examples.

21 page; 8 figures. Accepted for publication on Quantum information processing

References in corpus (9)

• A Quantum Random Walk Search Algorithm
• Exponential algorithmic speedup by quantum walk
• Quantum Random Walks Hit Exponentially Faster
• Coherent exciton transport in dendrimers and continuous-time quantum walks
• Quantum walks on quotient graphs
• Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
• Continuous-time quantum walks on one-dimension regular networks
• Investigation of Continuous-Time Quantum Walk Via Modules of Bose-Mesner and Terwilliger Algebras
• Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory