most citedFramework for discrete-time quantum walks and a symmetric walk on a binary tree

13 citations · 13 across the 2 of their papers we have counts for

collaborators

3 papers

math.DS2011

Speedups of ergodic group extensions

Andrey Babichev, Robert M. Burton, Adam Fieldsteel

We prove that for all ergodic extensions S_1 of a transformation by a locally compact second countable group G, and for all G-extensions S_2 of an aperiodic transformation, there i…

quant-ph2011★ 13 cited

Framework for discrete-time quantum walks and a symmetric walk on a binary tree

Zlatko Dimcovic, Daniel Rockwell, Ian Milligan +3

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2…

math.PR2006

Mixing times via super-fast coupling

Robert Burton, Yevgeniy Kovchegov

We provide a coupling proof that the transposition shuffle on a deck of n cards is mixing of rate Cn(log{n}) with a moderate constant, C. This rate was determined by Diaconis and S…