Grover’s Algorithm applied to the Molecular Distance Geometry Problem

Título: Grover’s Algorithm applied to the Molecular Distance Geometry Problem

Autores: Lavor, Carlile; Liberti, Leo; Maculan, Nelson

Resumo: Grover’s algorithm is a quantum algorithm for searching in unstructured databases. Due to the properties of quantum mechanics, it provides a quadratic speedup over its classical counterparts. We present a new application of the algorithm to the Molecular Distance Geometry 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.

Palavras-chave: Quantum Computation; Grover’s algorithm; Molecular Distance Geometry Problem

Páginas: 4

Código DOI: 10.21528/CBRN2005-234

Artigo em PDF: CBRN2005_234.pdf

Arquivo BibTex: CBRN2005_234.bib