  The Discretizable Molecular Distance Geometry Problem (DMDGP) aims to
determine the three-dimensional protein structure using distance information
from nuclear magnetic resonance experiments. The DMDGP has a finite number of
candidate solutions and can be solved by combinatorial methods. We describe a
quantum approach to the DMDGP by using Grover's algorithm with an appropriate
oracle function, which is more efficient than classical methods that use brute
force. We show computational results by implementing our scheme on IBM quantum
computers with a small number of noisy qubits.
