Fully Quantum Hash Function using Random Quantum Walks

As the digital landscape evolves, the need for robust cryptographic mechanisms to safeguard sensitive information increases with it. Moreover, the advent of quantum computers poses a formidable challenge to the security infrastructure that relies on classical cryptographic primitives.

Here, we utilize fully quantum hash functions (FQH) for quantum primitives, providing resistance to quantum attacks by replacing classical post-processing for further security. We used random unitaries, quantum walks, and much more to successfully build.

We faced a number of challenges throughout the way. At some point, our entire circuit was set up so that it should be (in theory!) functioning perfectly, but the quantum blocker was broken, so we had to go back and fix that.