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

Quantum Hashing

Karl Roesch

Published Nov 8, 2026• 0 citations
Publisher

Abstract

Quantum hashing
DOI
10.5281/zenodo.24045858

Related papers

Efficient Algorithms for Quantum Hashing

I. Zinnatullin, Kamil Ravilevich Khadiev

arXiv:2507.07002•Lecture notes in computer science•Jan 1, 2026•5 citations

Analysis of Properties of Quantum Hashing

Alexander Vasiliev, A. R. Vasilov, M. A. Latypov

Journal of Mathematical Sciences•Jul 29, 2019•5 citations

Quantum hashing based on symmetric groups

Mansur Ziatdinov

The notion of quantum hashing formalized by F. Ablayev and A. Vasiliev in 2013. F. Ablayev and M. Ablayev in 2014 introduced the notion of quantum hash generator which is convenient technical tool for constructing quantum hash func- tions. M. Ziatdinov in 2014 presented group approach for constructing quantum hash functions. All these mentioned above results present constructions of quan- tum hash functions based on abelian groups. This paper continue the research on quantum hashing. Our approach allows us to construct quantum hash function working on any (finite) group. Also our approach allows us to construct quantum hash functions based on classical hash function from $NC^1$.

arXiv:1612.07646•Dec 21, 2016•0 citations

Efficient Equivalent of Shallow Quantum Hashing

Ilnar Zinnatullin, Alexander Vasiliev

Quantum hashing is a widely used technique in quantum computation that allows us to design space-efficient algorithms and protocols. Recently, Vasiliev has shown that the phase form of shallow quantum hashing can be implemented by a circuit of depth 2. In this paper, we establish a connection between shallow quantum hashing and single-qubit quantum hashing for the amplitude form. For a shallow circuit, we propose a circuit of depth 1 that achieves the same collision resistance.

quant-pharXiv:2511.19292•Nov 25, 2025•0 citations

Quantum Algorithm

WORLD SCIENTIFIC eBooks•Jul 9, 2024•0 citations

On Quantum Fingerprinting and Quantum Cryptographic Hashing

Farid Mansurovich Ablayev, Marat Ablayev

Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, whereas hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, whereas quantum fingerprinting and quantum hashing have a short history. In this chapter, we investigate quantum fingerprinting and quantum hashing. We present computational aspects of quantum fingerprinting and quantum hashing and discuss cryptographical properties of quantum hashing.

InTech eBooks•May 30, 2018•1 citation
The notion of quantum hashing formalized by F. Ablayev and A. Vasiliev in 2013. F. Ablayev and M. Ablayev in 2014 introduced the notion of quantum hash generator which is convenient technical tool for constructing quantum hash func- tions. M. Ziatdinov in 2014 presented group approach for constructing quantum hash functions. All these mentioned above results present constructions of quan- tum hash functions based on abelian groups. This paper continue the research on quantum hashing. Our approach allows us to construct quantum hash function working on any (finite) group. Also our approach allows us to construct quantum hash functions based on classical hash function from NC1NC^1NC1.
Fingerprinting and cryptographic hashing have quite different usages in computer science, but have similar properties. Interpretation of their properties is determined by the area of their usage: fingerprinting methods are methods for constructing efficient randomized and quantum algorithms for computational problems, whereas hashing methods are one of the central cryptographical primitives. Fingerprinting and hashing methods are being developed from the mid of the previous century, whereas quantum fingerprinting and quantum hashing have a short history. In this chapter, we investigate quantum fingerprinting and quantum hashing. We present computational aspects of quantum fingerprinting and quantum hashing and discuss cryptographical properties of quantum hashing.