Date of Award
2010
Document Type
Thesis
Publication Status
Version of Record
Submission Date
October 2026
Thesis/Dissertation Advisor [Chair]
Magliveras, Spyros S.
Abstract
The hidden subgroup problem has been an active topic of research in quantum computing for over the past 10 years. Out of all the literature that is out there on this topic, there are very few survey articles which discuss most or all of the details concerning the Abelian hidden subgroup problem. As a matter of fact , many articles [17, 26 , 22, 45] claim that an eff-icient quantum algorithm for the Abelian hidden subgroup problem is folklore. To quote Jozsa [21]: " ... the detailed description of an efficient quantum algorithm for the general abelian hidden subgroup problem seems not to have been described in the literature." Apart from banishing this folklore, the aim of this work is to serve as a monograph about the Abelian hidden subgroup, discussing many of the finer points that are ignored in the literature so as to make it accessible and comprehensible to the mathematically mature reader.
Extent
50 p.
Recommended Citation
Losert, Bernd, "The Finite Abelian Hidden Subgroup Problem" (2010). Electronic Theses and Dissertations 2010 - 2019. 196.
https://digitalcommons.fau.edu/etd_general_6/196
Identifier
FA00000790
Comments
Includes bibliography.|Thesis (M.S.)--Florida Atlantic University, 2010.|Includes bibliography.