Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physics Letters A

Classical random walk with memory versus quantum walk on a one-dimensional infinite chain

Jing-Feng Wu, Peng Xu, Xuanmin Zhu

Published May 3, 2019• 6 citations
Publisher
DOI
10.1016/j.physleta.2019.04.060

Related papers

Limitations of discrete-time quantum walk on a one-dimensional infinite chain

Jia-Yi Lin, Xuanmin Zhu, Shengjun Wu

Physics Letters A•Feb 1, 2018•2 citations

One dimensional quantum walks with memory

Michael Mc Gettrick

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 one previous step. We derive the amplitudes and probabilities for these walks, and point out how they differ from both classical random walks, and quantum walks without memory.

arXiv:0911.1653•Quantum Information and Computation•May 1, 2010•32 citations

Quantum walks with tuneable self-avoidance in one dimension

Elizabeth Camilleri, Peter P. Rohde, Jason Twamley

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Here the walker has memory of its previous locations and preferentially avoids stepping back to locations where it has previously resided. Classical self-avoiding random walks have found numerous algorithmic applications, most notably in the modelling of protein folding. We consider the analogous problem in the quantum setting - a quantum walk in one dimension with tunable levels of self-avoidance. We complement a quantum walk with a memory register that records where the walker has previously resided. The walker is then able to avoid returning back to previously visited sites or apply more general memory conditioned operations to control the walk. We characterise this walk by examining the variance of the walker's distribution against time, the standard metric for quantifying how quantum or classical a walk is. We parameterise the strength of the memory recording and the strength of the memory back-action on the walker, and investigate their effect on the dynamics of the walk. We find that by manipulating these parameters, which dictate the degree of self-avoidance, the walk can be made to reproduce ideal quantum or classical random walk statistics, or a plethora of more elaborate diffusive phenomena. In some parameter regimes we observe a close correspondence between classical self-avoiding random walks and the quantum self-avoiding walk.

arXiv:1401.1869•Scientific Reports•Apr 25, 2014•10 citations

Differences between Quantum Walks and Classical Random Walks in Limit Distributions

Yutaka Shikano, Andrei Yu. Khrennikov, Gregg S. Jaeger +2 more

AIP conference proceedings•Jan 1, 2011•1 citation

Differences between Quantum Walks and Classical Random Walks in Limit Distributions

Yutaka Shikano

AIP conference proceedings•Jan 1, 2011•4 citations

Infinite dimensional entangled Markov chains

Francesco Fidaleo

We continue the analysis of nontrivial examples of quantum Markov processes. This is done by applying the construction of entangled Markov chains obtained from classical Markov chains with infinite state--space. The formula giving the joint correlations arises from the corresponding classical formula by replacing the usual matrix multiplication by the Schur multiplication. In this way, we provide nontrivial examples of entangled Markov chains on $\bar{\cup_{J\subset Z} \bar{\otimes}_{J}F}^{C^{*}}$, $F$ being any infinite dimensional type $I$ factor, $J$ a finite interval of $Z$, and the bar the von Neumann tensor product between von Neumann algebras. We then have new nontrivial examples of quantum random walks which could play a rôle in quantum information theory. In view of applications to quantum statistical mechanics too, we see that the ergodic type of an entangled Markov chain is completely determined by the corresponding ergodic type of the underlying classical chain, provided that the latter admits an invariant probability distribution. This result parallels the corresponding one relative to the finite dimensional case. Finally, starting from random walks on discrete ICC groups, we exhibit examples of quantum Markov processes based on type $II_1$ von Neumann factors.

arXiv:math/0411202•Nov 9, 2004•0 citations
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Here the walker has memory of its previous locations and preferentially avoids stepping back to locations where it has previously resided. Classical self-avoiding random walks have found numerous algorithmic applications, most notably in the modelling of protein folding. We consider the analogous problem in the quantum setting - a quantum walk in one dimension with tunable levels of self-avoidance. We complement a quantum walk with a memory register that records where the walker has previously resided. The walker is then able to avoid returning back to previously visited sites or apply more general memory conditioned operations to control the walk. We characterise this walk by examining the variance of the walker's distribution against time, the standard metric for quantifying how quantum or classical a walk is. We parameterise the strength of the memory recording and the strength of the memory back-action on the walker, and investigate their effect on the dynamics of the walk. We find that by manipulating these parameters, which dictate the degree of self-avoidance, the walk can be made to reproduce ideal quantum or classical random walk statistics, or a plethora of more elaborate diffusive phenomena. In some parameter regimes we observe a close correspondence between classical self-avoiding random walks and the quantum self-avoiding walk.
We continue the analysis of nontrivial examples of quantum Markov processes. This is done by applying the construction of entangled Markov chains obtained from classical Markov chains with infinite state--space. The formula giving the joint correlations arises from the corresponding classical formula by replacing the usual matrix multiplication by the Schur multiplication. In this way, we provide nontrivial examples of entangled Markov chains on ∪J⊂Z⊗ˉJFˉC∗\bar{\cup_{J\subset Z} \bar{\otimes}_{J}F}^{C^{*}}∪J⊂Z​⊗ˉ​J​Fˉ​C∗, FFF being any infinite dimensional type III factor, JJJ a finite interval of ZZZ, and the bar the von Neumann tensor product between von Neumann algebras. We then have new nontrivial examples of quantum random walks which could play a rôle in quantum information theory. In view of applications to quantum statistical mechanics too, we see that the ergodic type of an entangled Markov chain is completely determined by the corresponding ergodic type of the underlying classical chain, provided that the latter admits an invariant probability distribution. This result parallels the corresponding one relative to the finite dimensional case. Finally, starting from random walks on discrete ICC groups, we exhibit examples of quantum Markov processes based on type II1II_1II1​ von Neumann factors.