Related papers: Mixing Times for the Commuting Chain on CA Groups
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform…
We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…
If $K$ is a closed subgroup of a compact group $G$, the probability that randomly chosen pair of elements from $K$ and $G$ commute is denoted by $Pr(K,G)$. Say that a subgroup $K\leq G$ is $\epsilon$-central in $G$ if $Pr(\langle g…
We develop a method for analyzing the mixing times for a quite general class of Markov chains on the complete monomial group G \wr S_n (the wreath product of a group G with the permutation group S_n) and a quite general class of Markov…
We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact…
We consider finite-state time-nonhomogeneous Markov chains where the probability of moving from state $i$ to state $j\neq i$ at time $n$ is $G(i,j)/n^\zeta$ for a ``generator'' matrix $G$ and strength parameter $\zeta>0$. In these chains,…
A continuous quantum walk on a graph $X$ with adjacency matrix $A$ is specified by the 1-parameter family of unitary matrices $U(t)=\exp(itA)$. These matrices act on the state space of a quantum system, the states of which we may represent…
Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…
Switching interacting particle systems studied in probability theory are the stochastic processes of hopping particles on a lattice made up of slow and fast particles, where the switching between these types of particles occurs randomly at…
We establish bounds on the mixing times of conjugacy-invariant random walks on finite nilpotent groups in terms of the mixing times of their projections onto the abelianization. This comparison framework shows that, in several natural cases…
This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\sigma$, the complete graph $K^\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete…
We investigate the conditions under which a moving condensate may exist in a driven mass transport system. Our paradigm is a minimal mass transport model in which $n-1$ particles move simultaneously from a site containing $n>1$ particles to…
For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…
We consider irreversible Markov chains on finite commutative rings randomly generated using both addition and multiplication. We restrict ourselves to the case where the addition is uniformly random and multiplication is arbitrary. We first…
Let G be a vertex transitive graph. A study of the range of simple random walk on G and of its bridge is proposed. While it is expected that on a graph of polynomial growth the sizes of the range of the unrestricted random walk and of its…
Providing evidence that quantum computers can efficiently prepare low-energy or thermal states of physically relevant interacting quantum systems is a major challenge in quantum information science. A newly developed quantum Gibbs sampling…
The time evolution of many physical, chemical, and biological systems can be modelled by stochastic transitions between the minima of the potential energy surface describing the system of interest. We show that in cases where there are two…
Let G be a group, and let M=(m_n) be a sequence of finitely supported probability measures on G. Consider the probability that two elements chosen independently according to m_n commute. Antolin, Martino and Ventura define the 'degree of…
Particles confined to a single file, in a narrow quasi-one dimensional channel, exhibit a dynamic crossover from single file diffusion to Fickian diffusion as the channel radius increases and the particles can begin to pass each other. The…