Control-Target Inversion Property on Abelian Groups

We show that the quantum fourier transform on finite fields used to solve query problems is a special case of the usual quantum fourier transform on finite abelian groups. we show that the control-target inversion property holds in general. we apply this to get a sharp query complexity separation between classical and quantum algorithms for a hidden homomorphism problem on finite abelian groups.