Efficient Equivalent of Shallow Quantum Hashing
Quantum Physics
2025-11-25 v1
Abstract
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.
Cite
@article{arxiv.2511.19292,
title = {Efficient Equivalent of Shallow Quantum Hashing},
author = {Ilnar Zinnatullin and Alexander Vasiliev},
journal= {arXiv preprint arXiv:2511.19292},
year = {2025}
}