Related papers: Counting walks in a quadrant: a unified approach v…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
Random walks in the quarter plane are an important object both of combinatorics and probability theory. Of particular interest for their study, there is an analytic approach initiated by Fayolle, Iasnogorodski and Malyshev, and further…
We introduce a general framework of matrix-form combinatorial Riemann boundary value problem (cRBVP) to characterize the integrability of functional equations arising in lattice walk enumerations. A matrix cRBVP is defined as integrable if…
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
Recently, we provided a simple but accurate formula which closely approximates the first crossing distribution associated with random walks having correlated steps. The approximation is accurate for the wide range of barrier shapes of…
We extend the classification of nearest neighbour walks in the quarter plane to models in which multiplicities are attached to each direction in the step set. Our study leads to a small number of infinite families that completely…
We consider discrete (time and space) random walks confined to the quarter plane, with jumps only in directions $(i,j)$ with $i+j \geq 0$ and small negative jumps, i.e., $i,j \geq -1$. These walks are called singular, and were recently…
In this paper, we study a family of lattice walks which are related to the Hadamard conjecture. There is a bijection between paths of these walks which originate and terminate at the origin and equivalence classes of partial Hadamard…
The number of walks of $k$ steps from the node $\mathsf{0}$ to the node $\lambda$ on the representation graph (McKay quiver) determined by a finite group $\mathsf{G}$ and a $\mathsf{G}$-module $\mathsf{V}$ is the multiplicity of the…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
The kernel method is an essential tool for the study of generating series of walks in the quarter plane. This method involves equating to zero a certain polynomial, the kernel polynomial, and using properties of the curve, the kernel curve,…
Inspired by the classical phenomenon of random walk, the concept of quantum walk has emerged recently as a powerful platform for the dynamical simulation of complex quantum systems, entanglement production and universal quantum computation.…
In this paper the multi-dimensional random walk models governed by distributed fractional order differential equations and multi-term fractional order differential equations are constructed. The scaling limits of these random walks to a…
We introduce techniques to analyze unitary operations in terms of quadratic form expansions, a form similar to a sum over paths in the computational basis when the phase contributed by each path is described by a quadratic form over…
In this paper, we determine an explicit formula for the number of walks in $X_n = \textsf{Cay}(\mathbb{Z}_n,\mathbb{U}_n)$, the unitary Cayley Graphs of order $n$, between any pair of its vertices. With this result, we give the number of…
We analyze the Brownian Motion limit of a prototypical unit step reinforced random-walk on the half line. A reinforced random walk is one which changes the weight of any edge (or vertex) visited to increase the frequency of return visits.…
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…
We examine the aggregate behavior of one-dimensional random walks in a model known as (one-dimensional) Internal Diffusion Limited Aggregation. In this model, a sequence of $n$ particles perform random walks on the integers, beginning at…
We implement the proof of principle for the quantum walk of one ion in a linear ion trap. With a single-step fidelity exceeding 0.99, we perform three steps of an asymmetric walk on the line. We clearly reveal the differences to its…