Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm

M. V. Panduranga Rao
Phys. Rev. A 67, 052306 – Published 22 May 2003; Erratum Phys. Rev. A 73, 019902 (2006)
PDFExport Citation

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

Erratum

Authors & Affiliations

M. V. Panduranga Rao*

  • Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560 012, India

  • *Electronic address: pandurang@csa.iisc.ernet.in

References (Subscription Required)

Click to Expand
Issue

Vol. 67, Iss. 5 — May 2003

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×