STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
An Example of the Difference Between Quantum and Classical Random Walks
Quantum Information Processing
Quantum Walks on the Hypercube
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Continuous-time quantum walks on the threshold network model
Mathematical Structures in Computer Science
Localization of quantum walks on a deterministic recursive tree
Quantum Information & Computation
Quantum walks: a comprehensive review
Quantum Information Processing
Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks
Quantum Information Processing
Hi-index | 0.00 |
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 ~ t 驴3 and ~ 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.