Rao, Panduranga MV (2003) Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm. In: Physical Review A (Atomic, Molecular, and Optical Physics), 67 (5). pp. 52306-1.
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.
|Item Type:||Journal Article|
|Additional Information:||The DOI is currently only displayed. Copyright for this article belongs to American Physical Society (APS)|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||09 Jun 2004|
|Last Modified:||19 Sep 2010 04:12|
Actions (login required)