Physics – Quantum Physics
Scientific paper
2003-08-13
Physics
Quantum Physics
9 pages, 1 figure
Scientific paper
Continuous-time quantum walks on graphs is a generalization of continuous-time Markov chains on discrete structures. Moore and Russell proved that the continuous-time quantum walk on the $n$-cube is instantaneous exactly uniform mixing but has no average mixing property. On complete (circulant) graphs $K_{n}$, the continuous-time quantum walk is neither instantaneous (except for $n=2,3,4$) nor average uniform mixing (except for $n=2$). We explore two natural {\em group-theoretic} generalizations of the $n$-cube as a $G$-circulant and as a bunkbed $G \rtimes \Int_{2}$, where $G$ is a finite group. Analyses of these classes suggest that the $n$-cube might be special in having instantaneous uniform mixing and that non-uniform average mixing is pervasive, i.e., no memoryless property for the average limiting distribution; an implication of these graphs having zero spectral gap. But on the bunkbeds, we note a memoryless property with respect to the two partitions. We also analyze average mixing on complete paths, where the spectral gaps are nonzero.
Adamczak William
Andrew Kevin
Hernberg Peter
Tamon Christino
No associations
LandOfFree
A note on graphs resistant to quantum uniform mixing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A note on graphs resistant to quantum uniform mixing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on graphs resistant to quantum uniform mixing will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-2563