Related papers: Counting walks in a quadrant: a unified approach v…
We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions. Our method integrates variational quantum circuits with…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
We treat a position dependent quantum walk (QW) on the line which we assign two different time-evolution operators to positive and negative parts respectively. We call the model "the two-phase QW" here, which has been expected to be a…
We propose a new family of discrete-spacetime quantum walks capable to propagate on any arbitrary triangulations. Moreover we also extend and generalize the duality principle introduced by one of the authors, linking continuous local…
We consider partially directed walks crossing a $L\times L$ square weighted according to their length by a fugacity $t$. The exact solution of this model is computed in three different ways, depending on whether $t$ is less than, equal to…
We present the method of walk-sum to study the real-time dynamics of interacting quantum many-body systems. The walk-sum method generates explicit expressions for any desired pieces of an evolution operator U independently of any others.…
The analysis of the return probability is one of the most essential and fundamental topics in the study of classical random walks. In this paper, we study the return probability of quantum and correlated random walks in the one-dimensional…
Beaton, Owczarek and Xu (2019) studied generating functions of Kreweras walks and of reverse Kreweras walks in the quarter plane, with interacting boundaries. They proved that for the reverse Kreweras step set, the generating function is…
Discrete time quantum walks are known to be universal for quantum computation. This has been proven by showing that they can simulate a universal quantum gate set. In this paper, we examine computation by quantum walks in terms of language…
Expected urban population doubling calls for a compelling theory of the city. Random walks and diffusions defined on spatial city graphs spot hidden areas of geographical isolation in the urban landscape going downhill. First--passage time…
The article provides an explicit algebraic expression for the generating function of walks on graphs. Its proof is based on the scattering theory for the differential Laplace operator on non-compact graphs.
It has been observed that quantum walks on regular lattices can give rise to wave equations for relativistic particles in the continuum limit. In this paper we define the 3D walk as a product of three coined one-dimensional walks. The…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…
The motivation for this paper is the study of the phase transition for recurrence/transience of a class of self-interacting random walks on trees, which includes the once-reinforced random walk. For this purpose, we define a quantity, that…
Loop counting functions $U(x)$ estimate the number of "weighted" loops in a digital representation of $x\in[-1,1]$. Roughly speaking, each $x$ is considered as an infinite walk, where the steps of the walk correspond to digits of $x$. The…
We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…