相关论文: Open quantum random walks on the half-line: the Ka…

We construct the conditional version of $k$ independent and identically distributed random walks on $\R$ given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random…

Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…

Cramer's theorem provides an estimate for the tail probability of the maximum of a random walk with negative drift and increments having a moment generating function finite in a neighborhood of the origin. The class of (g,F)-processes…

Recently, in ["The coin-turning walk and its scaling limit", Electronic Journal of Probability, 25 (2020)], the ``coin-turning walk'' was introduced on ${\mathbb Z}$. It is a non-Markovian process where the steps form a (possibly)…

Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…

In this paper, we investigate the distribution of $k$-free numbers in a class of $\alpha$-random walks on the integer lattice $\mathbb{Z}$. In these walks, the walker starts from a non-negative integer $r$ and moves to the right by $a$…

It has been discovered that open quantum walks diffusively distribute in space, since they were introduced in 2012. Indeed, some limit distributions have been demonstrated and most of them are described by Gaussian distributions. We operate…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there…

We propose a variation of the quantum walk on a circle in phase space by conjoining the Hadamard coin flip with simultaneous displacement of the walker's location in phase space and show that this generalization is a proper quantum walk…

A second-order random walk on a graph or network is a random walk where transition probabilities depend not only on the present node but also on the previous one. A notable example is the non-backtracking random walk, where the walker is…

This paper considers a class of non-Markovian discrete-time random processes on a finite state space {1,...,d}. The transition probabilities at each time are influenced by the number of times each state has been visited and by a fixed a…

To model a complex system intrinsically separated by a barrier, we use two random Hamiltonians, coupled to each other either by a tunneling matrix element or by an intermediate transition state. We study that model in the universal limit of…

In this article we study a one dimensional model for a polymer in a poor solvent: the random walk on $\mathbb{Z}$ penalized by its range. More precisely, we consider a Gibbs transformation of the law of the simple symmmetric random walk by…

The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…

Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…

We discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…

We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…

In quantum theory, the modulus-square of the inner product of two normalized Hilbert space elements is to be interpreted as the transition probability between the pure states represented by these elements. A probabilistically motivated and…

In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…