ANALYSIS OF PROPERTIES OF QUANTUM HASHING

摘要

We analyze a method of binary quantum hashing that allows one to represent binary sets as quantum states. We show that this method is very stable with respect to the recovery of preimages. Moreover, we propose heuristic approaches to small-bias sets on which the construction of quantum hash-functions is based and show that they are stable with respect to collisions.