Grover’s Algorithm applied to the Molecular Distance Geometry Problem
Carlile Lavor, Leo Liberti, Nelson Maculan · 2016
Grover's algorithm is a quantum algorithm for searching in unstructured databases. Due to the proper- ties of quantum mechanics, it provides a quadratic speedup over its classical counterparts. We present a new applica- tion of the algorithm to the Molecular Distance Geome- try Problem. This problem is related to the determination of the tridimensional structure of a molecule based on the knowledge of some of the distances between pairs of atoms. This problem is NP-hard unless all possible inter-atomic distances are known. Index Terms—Quantum Computation, Grover's algo- rithm, Molecular Distance Geometry Problem.