Quantum hashing for finite abelian groups

Resumo

We propose a generalization of the quantum hashing technique based on the notion of small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum presentation of elements of any finite abelian group, which can be used in various computational and cryptographic scenarios. We consider two special cases of the proposed quantum hashing which turn out to be the known quantum fingerprinting schemas.