Phys. Rev. A 67, 052306 (2003) [6 pages]Solving a hidden subgroup problem using the adiabatic quantum-computing paradigmSee Also: Erratum Received 6 December 2002; published 22 May 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. © 2003 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.67.052306
DOI:
10.1103/PhysRevA.67.052306
PACS:
03.67.Lx
See AlsoErratum: M. V. Panduranga Rao, Erratum: Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm [Phys. Rev. A 67, 052306 (2003)], Phys. Rev. A 73, 019902 (2006). |
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.