Related papers: A walk on max-plus algebra
The paper analyzes a specific class of random walks on quotients of $X:=\text{SL}(k,{\Bbb R})/ \Gamma$ for a lattice $\Gamma$. Consider a one parameter diagonal subgroup, $\{g_t\}$, with an associated abelian expanding horosphere, $U\cong…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
The Maximum Matching problem has a quantum query complexity lower bound of $\Omega(n^{3/2})$ for graphs on $n$ vertices represented by an adjacency matrix. The current best quantum algorithm has the query complexity $O(n^{7/4})$, which is…
We survey and discuss upper bounds on the length of the transient phase of max-plus linear systems and sequences of max-plus matrix powers. In particular, we explain how to extend a result by Nachtigall to yield a new approach for proving…
Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…
We consider the limit distributions of open quantum random walks on one-dimensional lattice space. We introduce a dual process to the original quantum walk process, which is quite similar to the relation of Schr\"odinger-Heisenberg…
The treatment of two-dimensional random walks in the quarter plane leads to Markov processes which involve semi-infinite matrices having Toeplitz or block Toeplitz structure plus a low-rank correction. Finding the steady state probability…
The quantum walk is a quantum counterpart of the classical random walk. On the other hand, absolute zeta functions can be considered as zeta functions over $\mathbb{F}_1$. This study presents a connection between quantum walks and absolute…
By adding an extra Hilbert space to Hadamard Quantum Walk on Cycles (QWC), we presented a new type of QWCs called M\"obius Quantum Walk (MQW). The new space configuration enables the particle to rotate around the axis of movement. We…
We consider the 2D alternate quantum walk on a cylinder. We concentrate on the study of the motion along the open dimension, in the spirit of looking at the closed coordinate as a small or "hidden" extra dimension. If one starts from…
A discrete-time quantum walk is the quantum analogue of a Markov chain on a graph. Zhan [J. Algebraic Combin. 53(4):1187-1213, 2020] proposes a model of discrete-time quantum walk whose transition matrix is given by two reflections, using…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
The parametric maximum likelihood estimation problem is addressed in the context of quantum walk theory for quantum walks on the lattice of integers. A coin action is presented, with the real parameter $\theta$ to be estimated identified…
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 on which this is based. The framework has no need for coin…
Quantum walks are counterparts of classical random walks. They spread faster, which can be exploited in information processing tasks, and constitute a versatile simulation platform for many quantum systems. Yet, some of their properties can…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
We give a summary of recent progress on the signed area enumeration of closed walks on planar lattices. Several connections are made with quantum mechanics and statistical mechanics. Explicit combinatorial formulae are proposed which rely…
The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smaller Hilbert space, which is spanned merely by the site basis.…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…