An abelian subgroup problem was solved using the adiabatic quantum-computing paradigm. The time step complexity was a polynomial in the number of input orbits. A Hamiltonian was constructed in such a way that its ground state encodes the required solution set.