Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs

Abstract

In this paper we define direct product of graphs and give a recipe for obtained probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph obtain by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determine probability of walk on complicated graphs. Using this method, we calculate the probability of continuous-time classical and quantum random walks on many of finite direct product cayley graphs (complete cycle, complete $K_n$, charter and $n$-cube). Also, we inquire that the classical state the stationary uniform distribution is reached as $t⟶\infty$ but for quantum state is not always satisfy.

21, page. Accepted for publication on CTP

References in corpus (6)

• Quantum Computation and Decision Trees
• Exponential algorithmic speedup by quantum walk
• An example of the difference between quantum and classical random walks
• Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
• 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

Cited by in corpus (3)

• Quantum walks: a comprehensive review
• Recurrence and Polya number of general one-dimensional random walks
• Investigation graph isomorphism problem via entanglement entropy in strongly regular graphs