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

International Journal of Theoretical Physics

Quantum Walks with Memory Provided by Parity of Memory

Dan Li, Michael Mc Gettrick, Yu‐Guang Yang, Juan Xu, Yuan Wang

Published Apr 21, 2020• 6 citations
Publisher
DOI
10.1007/s10773-020-04466-5

Related papers

Quantum walks with memory on cycles

Michael Mc Gettrick, Jarosław Adam Miszczak

arXiv:1301.2905•Physica A Statistical Mechanics and its Applications•Jan 11, 2014•15 citations

One-dimensional quantum walks with two-step memory

Qing Zhou, Songfeng Lu

arXiv:1904.06528•Quantum Information Processing•Oct 22, 2019•8 citations

Quantum vs. classical walks with memory two

Zlatko Dimcovic, Yevgeniy Kovchegov

Bulletin of the American Physical Society•Mar 15, 2010•0 citations

Quantum random access memory utilizing discrete-time and continuous-time quantum walks

Ryo Asaka

•Mar 18, 2024•0 citations

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

Jing-Feng Wu, Peng Xu, Xuanmin Zhu

Physics Letters A•May 3, 2019•5 citations

Quantum-inspired Hash Function Based on Parity-dependent Quantum Walks with Memory

Qing Zhou, Xueming Tang, Songfeng Lu +1 more

In this paper, we develop a generic controlled alternate quantum walk model (called CQWM-P) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and then construct a quantum-inspired hash function (called QHFM-P) based on this model. Numerical simulation shows that QHFM-P has near-ideal statistical performance and is on a par with the state-of-the-art hash functions based on discrete quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property. Stability test illustrates that the statistical properties of the proposed hash function are robust with respect to the coin parameters, and theoretical analysis indicates that QHFM-P has the same computational complexity as that of its peers.

arXiv:2308.05357•Aug 10, 2023•0 citations
In this paper, we develop a generic controlled alternate quantum walk model (called CQWM-P) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and then construct a quantum-inspired hash function (called QHFM-P) based on this model. Numerical simulation shows that QHFM-P has near-ideal statistical performance and is on a par with the state-of-the-art hash functions based on discrete quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property. Stability test illustrates that the statistical properties of the proposed hash function are robust with respect to the coin parameters, and theoretical analysis indicates that QHFM-P has the same computational complexity as that of its peers.