RESEARCH ON APPLICATION OF GROVER'S QUANTUM ALGORITHM TO DNA SEQUENCING

Abstract

In order to search through an unstructured database of N elements, Grover's quantum search algorithm has O (√N) time complexity and uses O (log N) storage space thanks to the application of quantum mechanical properties (such as, superposition, entanglement,...) in each step of this algorithm. In this article, we studied the Grover quantum algorithm and clarified the quantum supremacy of the algorithm by analyzing the "behavior" of quantum mechanical properties in each step of this algorithm. In addition, we calculated and implemented on IBM quantum computers through the Qiskit platform in applicating for the problem of DNA sequencing with a string of length N = 8. The results showed that the Grover’s quantum search algorithm has superior search capabilities compared to existing algorithms as the quantum computer has a sufficient number of qubits, which helps to reduce the time and resources needed to determine the gene sequence and provides more effective methods for molecular biology.