Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm
M. V. Panduranga Rao · Physical Review A · 2003
We present and solve a restricted Abelian hidden subgroup problem using the adiabatic quantum-computing paradigm. The time step complexity is shown to be a polynomial in the number of input qubits. This paper is a step towards looking at the Abelian hidden subgroup problem from a quantum adiabatic standpoint.