Related papers: Quantum state revivals in quantum walks on cycles
Polya showed in his 1921 paper that the generating function of the return probability for a two-dimensional random walk can be written in terms of an elliptic integral. In this paper we present a similar expression for a one-dimensional…
We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are…
We consider a two-state quantum walk on a line where after the first step an absorbing sink is placed at the origin. The probability of finding the walker at position $j$, conditioned on that it has not returned to the origin, is…
We propose a new quantum numerical scheme to control the dynamics of a quantum walker in a two dimensional space-time grid. More specifically, we show how, introducing a quantum memory for each of the spatial grid, this result can be…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the…
We show how a quantum walk can be implemented for the first time in a quantum quincunx created via superconducting circuit quantum electrodynamics (QED), and how interpolation from quantum to random walk is implemented by controllable…
We investigate quantum walks which play an important role in the modelling of many phenomena. The detailed and thorough description is given to the discrete quantum walks on a line, where the total quantum state consists of quantum states…
We provide a reformulation of finite dimensional quantum theory in the circuit framework in terms of mathematical axioms, and a reconstruction of quantum theory from operational postulates. The mathematical axioms for quantum theory are the…
It is shown how to construct quantum random walks with particles in an arbitrary faithful normal state. A convergence theorem is obtained for such walks, which demonstrates a thermalisation effect: the limit cocycle obeys a quantum…
A quantum walk is a time-homogeneous quantum-mechanical process on a graph defined by analogy to classical random walk. The quantum walker is a particle that moves from a given vertex to adjacent vertices in quantum superposition. Here we…
We implement a quantum walk in phase space with a new mechanism based on the superconducting resonator-assisted double quantum dots. By analyzing the hybrid system, we obtain the necessary factors of realization of a quantum walk in phase…
Associated to a random walk on $\mathbb{Z}$ and a positive integer $n$, there is a return probability of the random walk returning to the origin after $n$ steps. An interesting question is when the set of return probabilities uniquely…
Recurrence time quantifies the duration required for a physical system to return to its initial state, playing a pivotal role in understanding the predictability of complex systems. In quantum systems with subspace measurements, recurrence…
We advance the previous studies of quantum walks on the line with two coins. Such four-state quantum walks driven by a three-direction shift operator may have nonzero stationary distributions (localization), thus distinguishing themselves…
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…
In the note we show how the choice of the initial states can influence the evolution of time-averaged probability distribution of the quantum walk on even cycles.
This paper presents a novel quantum walk approach to simulating parton showers on a quantum computer. We demonstrate that the quantum walk paradigm offers a natural and more efficient approach to simulating parton showers on quantum…
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…