相关论文: The meeting problem in the quantum random walk

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

We consider asymptotic behaviour of a Hadamard walk on a cycle. For a walk which starts with a state in which all the probability is concentrated on one node, we find the explicit formula for the limiting distribution and discuss its…

The article deals with one- and two-particle quantum walks on a graph with Braess-like topology and analyzes the issue of network congestion in the quantum world. Our approach to the study of congestion in quantum networks is based on the…

We investigate the dynamics of continuous-time two-particle quantum walks on a one-dimensional noisy lattice. Depending on the initial condition, we show how the interplay between particle indistinguishability and interaction determines…

A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…

The exact mean time between encounters of a given particle in a system consisting of many particles undergoing random walks in discrete time is calculated, on both regular and complex networks. Analytical results are obtained both for…

The quantum and classical behaviors of two-dimensional (2D) alternative quantum walk (AQW) in the presence of decoherence have been discussed in detail. For any kinds of decoherence, the analytic expressions for the moments of position…

Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

We formulate a discrete two-state stochastic process with elementary rules that give rise to Born statistics and reproduce the probabilities from the Schr\"odinger equation under an associated Hamiltonian matrix, which we identify. We…

We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…

Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…

Quantum particles move in strange ways, even when they propagate freely in space. As a result of the uncertainty principle, it is not possible to control the initial conditions of particle emission in such a way that the particle will…

Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these…

We introduce an analytically treatable spin decoherence model for quantum walk on a line that yields the exact position probability distribution of an unbiased classical random walk at all-time scales. This spin decoherence model depicts a…

Quantum walks can be used either as tools for quantum algorithm development or as entanglement generators, potentially useful to test quantum hardware. We present a novel algorithm based on a discrete Hadamard quantum walk on a line with…

We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…

We consider directional correlations between M-particles on a line. For non-interacting particles we find analytic asymptotic expressions. When delta-interaction is introduced in the model we study the Fourier analysis and obtain general…

We investigate the relation between transport properties and entanglement between the internal (spin) and external (position) degrees of freedom in one-dimensional discrete time quantum walks. We obtain closed-form expressions for the…

This paper gives various asymptotic formulae for the transition probability associated with discrete time quantum walks on the real line. The formulae depend heavily on the `normalized' position of the walk. When the position is in the…