相关论文: A walk on max-plus algebra
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
A quantum particle evolving by Schr\"odinger's equation contains, from the kinetic energy of the particle, a term in its Hamiltonian proportional to Laplace's operator. In discrete space, this is replaced by the discrete or graph Laplacian,…
Feller's book An Introduction to Probability Theory and Its Application discusses statistics corresponding to sequences of coin tosses, with a dollar being won or lost depending on the outcome of each toss. This is equivalent to analyzing…
Trying to enumerate all of the walks in a 2D lattice is a fun combinatorial problem and there are numerous applications, from polymers to sports. Computers provide a wonderful tool for analyzing these walks; we provide a Maple package for…
The purpose of these notes is to introduce some of the problems the enumeration of lattice walks is dedicated to and familiarize with some of the arguments they can be addressed with. We discuss the enumeration of lattice walks, their…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…
We survey the equations of continuous-time quantum walks on simple one-dimensional lattices, which include the finite and infinite lines and the finite cycle, and compare them with the classical continuous-time Markov chains. The focus of…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
Quantum walks (QWs) describe particles evolving coherently on a lattice. The internal degree of freedom corresponds to a Hilbert space, called coin system. We consider QWs on Cayley graphs of some group $G$. In the literature,…
The quantum walk is a quantum counterpart of the classical random walk. On the other hand, the absolute zeta function can be considered as a zeta function over F_1. This paper presents a connection between the quantum walk and the absolute…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
We establish a central limit theorem, a local limit theorem, and a law of large numbers for a natural random walk on a symmetric space $M$ of non-compact type and rank one. This class of spaces, which includes the complex and quaternionic…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
We show that with the addition of multiple walkers, quantum walks on a line can be transformed into lattice graphs of higher dimension. Thus, multi-walker walks can simulate single-walker walks on higher dimensional graphs and vice versa.…
Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…
The quantum walks in the lattice spaces are represented as unitary evolutions. We find a generator for the evolution and apply it to further understand the walks. We first extend the discrete time quantum walks to continuous time walks.…
We study Open Quantum Random Walks for which the underlying graph is a lattice, and the generators of the walk are translation-invariant. We consider the quantum trajectory associated with the OQRW, which is described by a position process…
The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is defined in terms of a combination of the following two operations: addition, $a \oplus b := \max(a,b)$, and multiplication, $a \otimes b := a + b$. In this study, we propose a new method…