Constant-Depth Algorithm for Quantum Hashing

Quantum hashing is one of the techniques that allow to construct space-efficient quantum algorithms and protocols. We present a construction that allows to make it extremely time efficient. Our approach is based on the shallow implementation of the quantum fingerprinting technique but uses additional circuit identities specific to the quantum hash function for the cyclic group. The resulting algorithm is equivalent to the one we have implemented earlier using single-photon states with orbital angular momentum encoding.