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

• URL: http://arxiv.org/abs/2512.18271v1
• Date: Sat, 20 Dec 2025 08:21:56 GMT
• Title: Quantum hash function using discrete-time quantum walk on Hanoi network
• Authors: Pulak Ranjan Giri,
• Abstract summary: We propose a quantum hash function based on the discrete-time quantum walk on a Hanoi network.<n>Message bits of our scheme control the flow of probability amplitude through the extra long-range edges and the conditional shift operators.<n>Our method even works for messages with small bit-lengths, contrary to most of the quantum walk based hash functions defined on a cycle.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quartic quantum speedups for community detection [84.14713515477784]
  We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
  arXiv  Detail & Related papers  (2025-10-09T17:35:17Z)
• Hybrid Quantum Walks Dynamics and Construction of a Quantum Cryptographic Primitive [0.0]
  The hybrid evolution operator consists of continuous time quantum walks and lackadaisical quantum walks as per choice of bits in binary input message.<n>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.
  arXiv  Detail & Related papers  (2025-05-21T07:25:34Z)
• Nested Hash Layer: A Plug-and-play Module for Multiple-length Hash Code Learning [61.095479786194836]
  Nested Hash Layer (NHL) is a plug-and-play module for deep supervised hashing models.<n>NHL generates hash codes of multiple lengths simultaneously in a nested structure.<n>NHL achieves an overall training speed improvement of approximately 5 to 8 times across various deep supervised hashing models.
  arXiv  Detail & Related papers  (2024-12-12T04:13:09Z)
• Fully Quantum Hash Function [3.2923780772605604]
  We introduce a novel, textitfully quantum hash (FQH) function within the quantum walk on a cycle framework. FQH requires minimal quantum resources to produce a large hash value, providing security against the birthday attack.
  arXiv  Detail & Related papers  (2024-08-07T10:28:32Z)
• On Reducing the Execution Latency of Superconducting Quantum Processors via Quantum Job Scheduling [47.39648643132327]
  We introduce the Quantum Job Scheduling Problem (QJSP) to improve the utility efficiency of quantum resources.<n>We propose a noise-aware quantum job scheduler (NAQJS) concerning the circuit width, number of measurement shots, and submission time of quantum jobs.<n>We conduct extensive experiments on a simulated Qiskit noise model, as well as on the Xiaohong (from QuantumCTek) superconducting quantum processor.
  arXiv  Detail & Related papers  (2024-04-11T16:12:01Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Controlled Alternate Quantum Walk based Block Hash Function [14.540996187637523]
  Controlled quantum walk based hash function is a kind of novel hash function, which is safe, flexible, high-efficient, and compatible. To process message in batch amounts, in this paper, controlled alternate quantum walk based block hash function is presented.
  arXiv  Detail & Related papers  (2022-05-12T09:42:17Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Hash function based on controlled alternate quantum walks with memory [16.247079214644796]
  We propose a new hash function QHFM based on controlled alternate quantum walks with memory on cycles. 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.
  arXiv  Detail & Related papers  (2021-05-31T08:30:08Z)
• Quantum Search for Scaled Hash Function Preimages [1.3299507495084417]
  We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions. We show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover's algorithm can only provide some marginal practical advantage in terms of error mitigation.
  arXiv  Detail & Related papers  (2020-09-01T18:00:02Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.