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 Hash Function Scheme via Continuous Time Quantum Walks Employing Alternate Hamiltonian in Evolution Operator

Rachana Soni, Neelam Choudhary, Navneet Pratap Singh

Published Jul 14, 2025• 1 citation
Publisher
DOI
10.1007/s10773-025-06067-6

Related papers

Quantum Hash Function Based on Memory-Driven Adaptive Controlled Alternate Quantum Walks

Songqi Tan, Tao Shang, Guangyuan Zheng +2 more

Communications in computer and information science•Jan 1, 2026•0 citations

Improving the efficiency of quantum hash function by dense coding of coin operators in discrete-time quantum walk

Yu‐Guang Yang, Yuchen Zhang, Gang Xu +3 more

Science China Physics Mechanics and Astronomy•Jan 18, 2018•24 citations

Controlled alternate quantum walk-based block hash function

Dan Li, Panpan Ding, Yuqian Zhou +1 more

arXiv:2205.05983•Quantum Information Processing•Oct 4, 2023•12 citations

Simple hash function using discrete-time quantum walks

Yu‐Guang Yang, Jing-Lin Bi, Xiu‐Bo Chen +3 more

Quantum Information Processing•Jun 20, 2018•26 citations

Continuous-time quantum hash function based on one-dimensional cycle lattice

Wei‐Min Shi, Wang Shou, Pan Tian +2 more

The proposed quantum hash function (QHF) based on the discrete-time quantum walk (DTQW) structure requires enlarging the coin state space and the preparation of continuous quantum states is less difficult. Hence, a new construction method of QHF is proposed based on the continuous-time quantum walk (CTQW) of the one-dimensional (1D) lattice with boundary constraints and without additional coin space. In the scheme, the input of the QHF is an arbitrary binary string message which is used to control the selected Hamiltonian of CTQW at each time interval, and the output of the QHF is the final probability distribution of CTQW. Under the same computing environment, simulation and analysis indicate that our QHF can satisfy the same security requirements such as sensitivity, diffusion and confusion, collision, birthday attack, but the collision rate is reduced by 40% without reducing effectiveness.

Modern Physics Letters B•Jun 17, 2022•5 citations

Discrete-time interacting quantum walks and quantum Hash schemes

Dan Li, Jie Zhang, Fen-Zhuo Guo +3 more

Quantum Information Processing•May 23, 2012•82 citations
The proposed quantum hash function (QHF) based on the discrete-time quantum walk (DTQW) structure requires enlarging the coin state space and the preparation of continuous quantum states is less difficult. Hence, a new construction method of QHF is proposed based on the continuous-time quantum walk (CTQW) of the one-dimensional (1D) lattice with boundary constraints and without additional coin space. In the scheme, the input of the QHF is an arbitrary binary string message which is used to control the selected Hamiltonian of CTQW at each time interval, and the output of the QHF is the final probability distribution of CTQW. Under the same computing environment, simulation and analysis indicate that our QHF can satisfy the same security requirements such as sensitivity, diffusion and confusion, collision, birthday attack, but the collision rate is reduced by 40% without reducing effectiveness.