School of Electrical Engineering and Automation, Henan Polytechnic University, Jiaozuo, China

---

Abstract—Traditional fingerprint matching has slow speed and low probability in search rate under large-scale and unstructured database background. In order to solve this problem, an advanced searching method based on Grover’s search algorithm is proposed. It improves the Oracle operator in Grover’s algorithm and transforms the database one into four registers: index register, quantum bit register which includes target fingerprint’s matching value, data register, 1 qubit register. Database two is transformed into including all the records of the matching value between input fingerprint and template fingerprints. Compared with traditional algorithm, this improved method decreases the number of repetitions and raise the probability of success, thus it can effectively improve the search speed and accuracy.

Index Terms—quantum parallelism, Grover’s searching algorithm, fingerprint matching, Oracle operator

[PDF]

Cite: Hui Li and Zhanzhan Zhang, "Unstructured Fingerprint Database Matching Method based on Grover’s Quantum Algorithm," Journal of Software vol. 7, no. 10, pp. 2301-2308, 2012.