Efficient Equivalent of Shallow Quantum Hashing
Ilnar Zinnatullin, Alexander Vasiliev

TL;DR
This paper demonstrates that shallow quantum hashing can be efficiently implemented with a depth-1 circuit, maintaining collision resistance, thus optimizing quantum hashing protocols.
Contribution
It establishes a connection between phase and amplitude forms of shallow quantum hashing and proposes a depth-1 circuit for amplitude form hashing.
Findings
Depth-1 circuit achieves the same collision resistance as depth-2 circuits.
Connection established between phase and amplitude forms of shallow quantum hashing.
Optimized quantum hashing circuits reduce complexity while maintaining security.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
