Related papers: Efficient approximate unitary designs from random …

Fix an irrational number $\alpha$. Let $X_1,X_2,\cdots$ be independent, identically distributed, integer-valued random variables with characteristic function $\varphi$, and let $S_n=\sum_{i=1}^n X_i$ be the partial sums. Consider the random…

We study random walks on groups of isometries of non-proper delta-hyperbolic spaces under the assumption that at least one element in the group satisfies Bestvina-Fujiwara's WPD condition. We show that in this case typical elements are WPD,…

Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…

We study large deviations for random walks on stratified (Carnot) Lie groups. For such groups, there is a natural collection of vectors which generates their Lie algebra, and we consider random walks with increments in only these…

Let G be a free product of a finite family of finite groups, with the set of generators being formed by the union of the finite groups. We consider a transient nearest-neighbour random walk on G. We give a new proof of the fact that the…

This work addresses problems on simultaneous Diophantine approximation on fractals, motivated by a long standing problem of Mahler regarding Cantor's middle $1/3$ set. We obtain the first instances where a complete analogue of Khintchine's…

We study Haar-random bases and pretty good measurement for Bayesian state estimation. Given $N$ Haar-random bases we derive a bound on fidelity averaged over IID sequences of such random measurements for a uniform ensemble of pure states.…

We study three different random walk models on several two-dimensional lattices by Monte Carlo simulations. One is the usual nearest neighbor random walk. Another is the nearest neighbor random walk which is not allowed to backtrack. The…

Epsilon-nets and approximate unitary $t$-designs are natural notions that capture properties of unitary operations relevant for numerous applications in quantum information and quantum computing. The former constitute subsets of unitary…

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

The main aim of the present set of notes is to give new, short and essentially self-contained proofs of some classical, as well as more recent, results about random walks on groups. For instance, we shall see that the drift characterization…

In this article we refine well-known results concerning the fluctuations of one-dimensional random walks. More precisely, if $(S_n)_{n \geq 0}$ is a random walk starting from 0 and $r\geq 0$, we obtain the precise asymptotic behavior as…

Most approximation algorithms for #P-complete problems (e.g., evaluating the permanent of a matrix or the volume of a polytope) work by reduction to the problem of approximate sampling from a distribution $\pi$ over a large set $\S$. This…

Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…

In this paper, we consider random walks on the isometry groups of general metric spaces. Under some mild conditions, we show that if two non-elementary random walks on a discrete subgroup of the isometry group have non-singular stationary…

This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…

It is well known that the spectral form factor (SFF) of a possibly degenerate many-body Hamiltonian can be identified with a planar random walk taking steps of unequal length. In this paper we push this identification further and propose to…

In this paper we outline an approach for analysing random walks on the chambers of buildings. The types of walks that we consider are those which are well adapted to the structure of the building: Namely walks with transition probabilities…

We study the problem of efficiently learning an unknown $n$-qubit unitary channel in diamond distance given query access. We present a general framework showing that if Pauli operators remain low-complexity under conjugation by a unitary,…

We consider a nonlinear random walk which, in each time step, is free to choose its own transition probability within a neighborhood (w.r.t. Wasserstein distance) of the transition probability of a fixed L\'evy process. In analogy to the…