Hidden Subgroup Problem : About Some Classical and Quantum Algorithms

FieldValue
dc.contributor.authorPerepechaenko, Maria
dc.date.accessioned2021-04-07T19:46:30Z
dc.date.available2021-04-07T19:46:30Z
dc.date.issued2021-04-07
dc.identifier.urihttp://hdl.handle.net/10393/41977
dc.identifier.urihttp://dx.doi.org/10.20381/ruor-26199
dc.description.abstractMost quantum algorithms that are efficient as opposed to their equivalent classical algorithms are solving variants of the Hidden Subgroup Problem (HSP), therefore HSP is a central problem in the field of quantum computing. In this thesis, we offer some interesting results about the subgroup and coset structure of certain groups, including the dihedral group. We describe classical algorithms to solve the HSP over various abelian groups and the dihedral group. We also discuss some existing quantum algorithms to solve the HSP and give our own novel algorithms and ideas to approach the HSP for the dihedral groups.
dc.language.isoen
dc.publisherUniversité d'Ottawa / University of Ottawa
dc.subjectHidden Subgroup Problem
dc.subjectHSP
dc.subjectDihedral Hidden Subgroup Problem
dc.subjectQuantum HSP
dc.subjectClassical HSP
dc.subjectQuantum computing
dc.subjectQuantum algorithms
dc.subjectClassical algorithms
dc.subjectStandard method
dc.subjectCoset sampling
dc.titleHidden Subgroup Problem : About Some Classical and Quantum Algorithms
dc.typeThesis
dc.contributor.supervisorNevins, Monica
thesis.degree.nameMSc
thesis.degree.levelMasters
thesis.degree.disciplineSciences / Science
uottawa.departmentMathématiques et statistique / Mathematics and Statistics
CollectionThèses, 2011 - // Theses, 2011 -

Files