2026-09-19T13:33:05Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1061022026-06-17T14:45:28Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Aram W. Harrow.
Zatloukal, Kevin C. (Kevin Chaffee)
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2016-12-22T16:29:05Z
2016-12-22T16:29:05Z
2016
2016
http://hdl.handle.net/1721.1/106102
965445128
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 163-168).
Shor's groundbreaking algorithms for integer factoring and discrete logarithm [58], along with their later generalizations 116, 35, 49, 18], demonstrated a unique ability of quantum computers to solve problems defined on abelian groups. In this thesis, we study ways in which that ability can be leveraged in order to solve problems on more complex structures such as non-abelian groups and hypergroups. This leads to new quantum algorithms for the hidden subgroup problem on nilpotent groups whose order is a product of large primes, the hidden subhypergroup problem on both strongly integral hypergroups and ultragroups, testing equivalence of group extensions, and computing the component parts of the cohomology groups of both group extensions and a generalization of simplicial complexes, amongst other problems. For each of those listed, we also show that no classical algorithm can achieve similar efficiency under standard cryptographic assumptions.
by Kevin C. Zatloukal.
Ph.D.
168 pages
eng
Massachusetts Institute of Technology
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Applications of abelian algebraic structures in quantum computation
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a72b6cad-46bd-4ba3-8c56-b254013745d8">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Applications of abelian algebraic structures in quantum computation</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Zatloukal, Kevin C. (Kevin Chaffee)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>Shor's groundbreaking algorithms for integer factoring and discrete logarithm [58], along with their later generalizations 116, 35, 49, 18], demonstrated a unique ability of quantum computers to solve problems defined on abelian groups. In this thesis, we study ways in which that ability can be leveraged in order to solve problems on more complex structures such as non-abelian groups and hypergroups. This leads to new quantum algorithms for the hidden subgroup problem on nilpotent groups whose order is a product of large primes, the hidden subhypergroup problem on both strongly integral hypergroups and ultragroups, testing equivalence of group extensions, and computing the component parts of the cohomology groups of both group extensions and a generalization of simplicial complexes, amongst other problems. For each of those listed, we also show that no classical algorithm can achieve similar efficiency under standard cryptographic assumptions.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>