相关论文: Quantum random walks with history dependence

The present letter gives a rigorous way from quantum to classical random walks by introducing an independent random fluctuation and then taking expectations based on a path integral approach.

Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This paper revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the…

Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…

The analysis of logarithmic return distributions defined over large time scales is crucial for understanding the long-term dynamics of asset price movements. For large time scales of the order of two trading years, the anticipated Gaussian…

Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…

In this paper, a study on discrete-time coined quantum walks on the line is presented. Clear mathematical foundations are still lacking for this quantum walk model. As a step towards this objective, the following question is being…

Quantum walk (QW) is the quantum analog of the random walk. QW is an integral part of the development of numerous quantum algorithms. Hence, an in-depth understanding of QW helps us to grasp the quantum algorithms. We revisit the…

In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…

We study the localization of probability distribution in a discrete quantum random walk on an infinite chain. With a phase defect introduced in any position of the quantum random walk (QRW), we have found that the localization of the…

The quantum random walk has drawn special interests because its remarkable features to the classical counterpart could lead to new quantum algorithms. In this paper, we propose a feasible scheme to implement quantum random walks on a line…

Recently, several groups have investigated quantum analogues of random walk algorithms, both on a line and on a circle. It has been found that the quantum versions have markedly different features to the classical versions. Namely, the…

We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…

We consider the discrete time unitary dynamics given by a quantum walk on the lattice $\Z^d$ performed by a quantum particle with internal degree of freedom, called coin state, according to the following iterated rule: a unitary update of…

The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…

We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…

We exhibit a way to associate a quantum walk (QW) on the non-negative integers to any probability measure on the unit circle. This forces us to consider one step transitions that are not traditionally allowed. We illustrate this in the case…

Parrondo's paradox refers to the counter-intuitive situation where a winning strategy results from a suitable combination of losing ones. Simple stochastic games exhibiting this paradox have been introduced around the turn of the…

We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of up to two previous steps. We derive the amplitudes and probabilities for…

The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely…

Our preferences depend on the circumstances in which we reveal them. We will introduce a dependency which allows us to illustrate the relation between the possibility of winning of particular candidates in a quantum election and the type of…