Abstract
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.
- Received 6 December 2002
DOI:https://doi.org/10.1103/PhysRevA.67.052306
©2003 American Physical Society