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 Conference on Quantum Communications, Networking, and Computing (QCNC)

Quantum Walk-Based Hash Function: Scalable Readout for Proof of Quantum Work

Shogo Shimada, Pulak Ranjan Giri, Rei Sato, Kazuhiro Saito

Published Apr 6, 2026• 1 citation
Publisher

Abstract

We investigate quantum walk-based hash functions, which are generated from the count distribution generated by a quantum walker on graphs. The method is expected to be one of the promising approaches for generating robust hash functions; however, the quantum computation in small systems is susceptible to spoofing via classical imitation. To address this issue, it is necessary to perform calculations in a quantum space size that classical algorithms are difficult to simulate. In such cases, simply increasing the quantum space size leads to an increase in the number of quantum circuit measurements, thereby increasing the time required to generate the ideal measurement distribution. Based on these facts, we propose a quantum hybrid algorithm combining a quantum walk with a shot-based random projection architecture. This method compresses the output into a fixed-length 256-bit hash by weighting and binarizing the measurement counts of each node. We investigate the proposed method through the numerical simulations of quantum walks on the Hanoi Network (HN4) with$N=4096$. The results demonstrate no hash collisions and an avalanche effect of approximately 49%, which is close to the ideal value of 50%. Additionally, we achieved the consensus robustness of up to 94%, compared to the ideal value of 100%. These results suggest the feasibility of a scalable quantum hash function for Proof of Quantum Work (PoQ) on quantum devices.

DOI
10.1109/qcnc69040.2026.00151

Related papers

Quantum hash function using discrete-time quantum walk on Hanoi network

Pulak Ranjan Giri

Quantum walk based hash functions have attracted a lot of attention in recent years because of its faster execution time and robust resistance against attacks compared to classical hash functions. It has been observed that the underlying graph and the way message controls the quantum walk iteration steps play a crucial role for the robustness of the hash function. We propose a quantum hash function based on the discrete-time quantum walk on a Hanoi network--a one dimensional periodic lattice with extra long-range edges of a specific form--which is highly collision resistant. The message bits of our scheme control the flow of probability amplitude through the extra long-range edges and the conditional shift operators. Our method even works for messages with small bit-lengths, contrary to most of the quantum walk based hash functions defined on a cycle, which usually work for messages with bit-lengths more than the length of the cycle.

quant-pharXiv:2512.18271•Modern Physics Letters A•Dec 23, 2025•1 citation

Hash Function Based on Controlled Alternate Quantum Walks With Memory (September 2021)

Qing Zhou, Songfeng Lu

We propose a Quantum inspired Hash Function using controlled alternate quantum walks with Memory on cycles (QHFM), where the$j$th message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the$j$th time step, and the hash value is calculated from the resulting probability distribution of the walker. Numerical simulation shows that the proposed hash function has near-ideal statistical performance and is at least on a par with the state-of-the-art hash functions based on quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property; and theoretical analysis indicates that the time and space complexity of the new scheme are not greater than those of its peers. The good performance of QHFM suggests that quantum walks that differ not only in coin operators but also in memory lengths can be combined to build good hash functions, which, in turn, enriches the construction of controlled alternate quantum walks.

arXiv:2105.14788•IEEE Transactions on Quantum Engineering•Nov 24, 2021•16 citations

Quantum hash function based on continuous quantum walks

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

A method of constructing a quantum hash function (QHF) based on continuous-time quantum walk is proposed, in which the time of quantum walk is controlled by the binary string message, namely, a binary string message as the input of the constructed QHF and the probability value of finally walking to the nodes on the cycle is used as the output of the QHF. Numerical simulation and performance analysis show that our QHF has obvious advantages in the efficiency of the QHF compared with the existing QHF based on the discrete-time quantum walk, that is, the efficiency of our scheme is nearly 4 times faster in computing the hash value of the same size file compared with the most efficient scheme. Besides, the QHF has also better collision resistance compared with the existing QHF based on the discrete-time quantum walk.

Modern Physics Letters A•Mar 7, 2024•1 citation

Hybrid Quantum Walks Dynamics and Construction of a Quantum Cryptographic Primitive

Rachana Soni, Neha Singh, Neelam Choudhary

In this research article, we design a quantum hash function model from hybrid quantum walks on finite path graph. The hybrid evolution operator consisting of integrated framework of continuous time quantum walks and lackadaisical quantum walks as per choice of bits in binary input message, acts on initial quantum state and generate quantum hash values from probability distribution of final quantum state. The quantum hash values generated through the proposed method is showing strong cryptographic properties in sensitivity analysis, collision analysis, statistical features analysis, birthday attack and uniform analysis. Our proposed framework is showing successful results utilizing mathematically well defined structure of hybrid quantum walks based on quantum mechanics phenomena.

arXiv:2505.15198•May 21, 2025•1 citation

A Stable Hash Function Based on Parity-Dependent Quantum Walks With Memory (August 2023)

Qing Zhou, Xueming Tang, Songfeng Lu +1 more

In this paper, we develop a generic controlled alternate quantum-walk model (called CQWMP) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and propose a hash function (called QHFM-P) based on this model. The statistical properties of the proposed scheme are stable with respect to the coin parameters of the underlying controlled quantum walks; with certain parameter values, the collision resistance property of QHFM-P is better than that of the state-of-the-art hash functions based on discrete quantum walks. Moreover, the proposed hash function can also maintain near-ideal statistical performance when the input message is of small length. Additionally, we derive a type of inappropriate initial states of hash functions based on one-dimensional one-particle quantum walks (with ordinary shift operator) on cycles, with which all messages will be mapped to the same hash value, regardless of the angles adopted by the coin parameters.

IEEE Transactions on Quantum Engineering•Jan 1, 2024•2 citations

Quantum Hash Function Based on Spectral Properties of Graphs and Discrete Walker Dynamics

Mohana Priya Thinesh Kumar, Pranavishvar Hariprakash

We present Quantum Graph Hash (QGH-256), a novel quantum spectral hashing algorithm that generates high-entropy fingerprints from message-induced graphs. Each input message is mapped to a weighted graph via a discrete random walk on an n X n toroidal grid, where the walk dynamics determine the edge weights. Quantum Phase Estimation (QPE) is then used to extract the phase spectrum of the graph Laplacian. Unlike standard QPE settings, the phase estimation is performed with respect to a superposition state (a uniform superposition over all node basis states) rather than an eigenvector, ensuring that all eigencomponents contribute to the resulting spectrum. This yields spectral features that distinguish even co-spectral but non-isomorphic message-induced graphs. The final spectral fingerprint is converted into a 256-bit digest, producing a compact representation of the input. As the fingerprint encodes both spectral and dynamical properties of the message-induced graph, the resulting hash exhibits strong sensitivity to input perturbations and provides a structurally rich foundation for post-quantum hashing. To demonstrate the feasibility of the approach, we implement QGH-256 on a 4 X 4 toroidal grid, chosen empirically: smaller grids exhibit collisions, whereas larger grids significantly increase execution time. The entire pipeline is implemented in Qiskit, and we use a seeded statevector simulator to obtain stable, noise-free results.

quant-pharXiv:2512.03581•Dec 4, 2025•0 citations
We investigate quantum walk-based hash functions, which are generated from the count distribution generated by a quantum walker on graphs. The method is expected to be one of the promising approaches for generating robust hash functions; however, the quantum computation in small systems is susceptible to spoofing via classical imitation. To address this issue, it is necessary to perform calculations in a quantum space size that classical algorithms are difficult to simulate. In such cases, simply increasing the quantum space size leads to an increase in the number of quantum circuit measurements, thereby increasing the time required to generate the ideal measurement distribution. Based on these facts, we propose a quantum hybrid algorithm combining a quantum walk with a shot-based random projection architecture. This method compresses the output into a fixed-length 256-bit hash by weighting and binarizing the measurement counts of each node. We investigate the proposed method through the numerical simulations of quantum walks on the Hanoi Network (HN4) withN=4096N=4096N=4096. The results demonstrate no hash collisions and an avalanche effect of approximately 49%, which is close to the ideal value of 50%. Additionally, we achieved the consensus robustness of up to 94%, compared to the ideal value of 100%. These results suggest the feasibility of a scalable quantum hash function for Proof of Quantum Work (PoQ) on quantum devices.
Quantum walk based hash functions have attracted a lot of attention in recent years because of its faster execution time and robust resistance against attacks compared to classical hash functions. It has been observed that the underlying graph and the way message controls the quantum walk iteration steps play a crucial role for the robustness of the hash function. We propose a quantum hash function based on the discrete-time quantum walk on a Hanoi network--a one dimensional periodic lattice with extra long-range edges of a specific form--which is highly collision resistant. The message bits of our scheme control the flow of probability amplitude through the extra long-range edges and the conditional shift operators. Our method even works for messages with small bit-lengths, contrary to most of the quantum walk based hash functions defined on a cycle, which usually work for messages with bit-lengths more than the length of the cycle.
We propose a Quantum inspired Hash Function using controlled alternate quantum walks with Memory on cycles (QHFM), where thejjjth message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at thejjjth time step, and the hash value is calculated from the resulting probability distribution of the walker. Numerical simulation shows that the proposed hash function has near-ideal statistical performance and is at least on a par with the state-of-the-art hash functions based on quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property; and theoretical analysis indicates that the time and space complexity of the new scheme are not greater than those of its peers. The good performance of QHFM suggests that quantum walks that differ not only in coin operators but also in memory lengths can be combined to build good hash functions, which, in turn, enriches the construction of controlled alternate quantum walks.
A method of constructing a quantum hash function (QHF) based on continuous-time quantum walk is proposed, in which the time of quantum walk is controlled by the binary string message, namely, a binary string message as the input of the constructed QHF and the probability value of finally walking to the nodes on the cycle is used as the output of the QHF. Numerical simulation and performance analysis show that our QHF has obvious advantages in the efficiency of the QHF compared with the existing QHF based on the discrete-time quantum walk, that is, the efficiency of our scheme is nearly 4 times faster in computing the hash value of the same size file compared with the most efficient scheme. Besides, the QHF has also better collision resistance compared with the existing QHF based on the discrete-time quantum walk.
In this research article, we design a quantum hash function model from hybrid quantum walks on finite path graph. The hybrid evolution operator consisting of integrated framework of continuous time quantum walks and lackadaisical quantum walks as per choice of bits in binary input message, acts on initial quantum state and generate quantum hash values from probability distribution of final quantum state. The quantum hash values generated through the proposed method is showing strong cryptographic properties in sensitivity analysis, collision analysis, statistical features analysis, birthday attack and uniform analysis. Our proposed framework is showing successful results utilizing mathematically well defined structure of hybrid quantum walks based on quantum mechanics phenomena.
In this paper, we develop a generic controlled alternate quantum-walk model (called CQWMP) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and propose a hash function (called QHFM-P) based on this model. The statistical properties of the proposed scheme are stable with respect to the coin parameters of the underlying controlled quantum walks; with certain parameter values, the collision resistance property of QHFM-P is better than that of the state-of-the-art hash functions based on discrete quantum walks. Moreover, the proposed hash function can also maintain near-ideal statistical performance when the input message is of small length. Additionally, we derive a type of inappropriate initial states of hash functions based on one-dimensional one-particle quantum walks (with ordinary shift operator) on cycles, with which all messages will be mapped to the same hash value, regardless of the angles adopted by the coin parameters.
We present Quantum Graph Hash (QGH-256), a novel quantum spectral hashing algorithm that generates high-entropy fingerprints from message-induced graphs. Each input message is mapped to a weighted graph via a discrete random walk on an n X n toroidal grid, where the walk dynamics determine the edge weights. Quantum Phase Estimation (QPE) is then used to extract the phase spectrum of the graph Laplacian. Unlike standard QPE settings, the phase estimation is performed with respect to a superposition state (a uniform superposition over all node basis states) rather than an eigenvector, ensuring that all eigencomponents contribute to the resulting spectrum. This yields spectral features that distinguish even co-spectral but non-isomorphic message-induced graphs. The final spectral fingerprint is converted into a 256-bit digest, producing a compact representation of the input. As the fingerprint encodes both spectral and dynamical properties of the message-induced graph, the resulting hash exhibits strong sensitivity to input perturbations and provides a structurally rich foundation for post-quantum hashing. To demonstrate the feasibility of the approach, we implement QGH-256 on a 4 X 4 toroidal grid, chosen empirically: smaller grids exhibit collisions, whereas larger grids significantly increase execution time. The entire pipeline is implemented in Qiskit, and we use a seeded statevector simulator to obtain stable, noise-free results.