Related papers: Nonreversal and nonrepeating quantum walks
We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…
Open quantum walks often lead to a classical asymptotic behavior. Here, we look for a simple open quantum walk whose asymptotic behavior can be non-classical. We consider a discrete-time quantum walk on n-cycle subject to a random…
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical…
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
We investigate a connection between a property of the distribution and a conserved quantity for the reversible cellular automaton derived from a discrete-time quantum walk in one dimension. As a corollary, we give a detailed information of…
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momentum of ultracold rubidium atoms (the walk space) and two internal atomic states (the "coin" degree of freedom). Our scheme is highly…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
We construct a quantum random walk algorithm, based on the Dirac operator instead of the Laplacian. The algorithm explores multiple evolutionary branches by superposition of states, and does not require the coin toss instruction of…
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the…
Recurrence in the classical random walk is well known and described by the P\'olya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under…
We perform the spectral analysis of the evolution operator U of quantum walks with an anisotropic coin, which include one-defect models, two-phase quantum walks, and topological phase quantum walks as special cases. In particular, we…
In this paper we extend the concept of persistence, well defined for classical stochastic dynamics, to the context of quantum dynamics. We demonstrate the idea via quantum random walk and a successive measurement scheme, where persistence…
It is shown that a standard one-dimensional coined discrete-time quantum walk can generate operationally admissible post-quantum correlations in a coin-position Bell scenario, without any modification of its unitary nearest-neighbor…
We study a spin-1/2-particle moving on a one dimensional lattice subject to disorder induced by a random, space-dependent quantum coin. The discrete time evolution is given by a family of random unitary quantum walk operators, where the…
Quantization and asymptotic behaviour of a variant of discrete random walk on integers are investigated. This variant, the $\epsilon_{V^{k}}$ walk, has the novel feature that it uses many identical quantum coins keeping at the same time…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…
A unit evolution step of discrete-time quantum walks is determined by both a coin-flip operator and a position-shift operator. The behavior of quantum walkers after many steps delicately depends on the coin-flip operator and an initial…
We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of…
Classical randomized algorithms use a coin toss instruction to explore different evolutionary branches of a problem. Quantum algorithms, on the other hand, can explore multiple evolutionary branches by mere superposition of states. Discrete…