Related papers: Quantum walks on cycles
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
In all existing quantum walk models, the assumption about a pre-existing fixed background causal structure is always made and has been taken for granted. Nevertheless, in this work we will get rid of this tacit assumption especially by…
Interplay between quantum interference and classical randomness can enhance performance of various quantum information tasks. In the present paper we analyze recurrence phenomena in the discrete-time quantum stochastic walk on a line, which…
We introduce the concept of a deterministic walk. Confining our attention to the finite state case, we establish hypotheses that ensure that the deterministic walk is transitive, and show that this property is in some sense robust. We also…
A simple Discrete-Time Quantum Walk on the line is revisited and given an hydrodynamic interpretation through a novel relativistic generalization of the Madelung transform. Numerical results are presented which show that suitable initial…
We treat a quantum walk (QW) on the line whose quantum coin at each vertex tends to be the identity as the distance goes to infinity. We obtain a limit theorem that this QW exhibits localization with not an exponential but a "power-law"…
In this paper we consider the one-dimensional quantum random walk X^{varphi} _n at time n starting from initial qubit state varphi determined by 2 times 2 unitary matrix U. We give a combinatorial expression for the characteristic function…
We study the motion of two non-interacting quantum particles performing a random walk on a line and analyze the probability that the two particles are detected at a particular position after a certain number of steps (meeting problem). The…
We study the asymptotic behaviour of occupation times of a transient random walk in quenched random environment on a strip in a sub-diffusive regime. The asymptotic behaviour of hitting times, which is a more traditional object of study, is…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…
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…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…
The quantum walk differs fundamentally from the classical random walk in a number of ways, including its linear spreading and initial condition dependent asymmetries. Using stationary phase approximations, precise asymptotics have been…
We treat three types of measures of the quantum walk (QW) with the spatial perturbation at the origin, which was introduced by [1]: time averaged limit measure, weak limit measure, and stationary measure. From the first two measures, we see…
We attempt to analyze a one-dimensional space-inhomogeneous quantum walk (QW) with one defect at the origin, which has two different quantum coins in positive and negative parts. We call the QW "the two-phase QW", which we treated…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…
In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a…