TY  - JOUR
T1  - Minimizing Collisions for Quantum Hashing
AU - Vasiliev, Alexander AU - Latypov, Marat AU - Ziatdinov, Mansur 
JO  - Journal of Engineering and Applied Sciences
VL  - 12
IS  - 4
SP  - 877
EP  - 880
PY  - 2017
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2017.877.880
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2017.877.880
KW  - Quantum computation
KW  -quantum information
KW  -quantum hashing
KW  -genetic algorithm
KW  -annealing simulation algorithm
AB  - Hashing is a widely used technique in computer science. The recently proposed quantum hashing has also proved its usefulness in a number of applications. The key property of both classical and quantum hashing is the ability to withstand collisions however, the notion of collision itself is different in the classical and quantum setting. In this study we analyze the set of numeric parameters that determine the probability of quantum collisions for the quantum hashing. Although, there is a general method of obtaining good hashing parameters, it makes sense for comparatively large inputs. That is why we construct different methods to complement the general one. We present two explicit optimization algorithms for computation of quantum hashing parameters: one is based on the genetic approach and the other uses the annealing simulation. The solution to the considered optimization problem can be used for the variety of quantum hash functions and also provides a solution to the general problem of constructing sets of pairwise distinguishable states in low-dimensional spaces.
ER  -