Show simple item record

dc.contributor.supervisor Gaur, Daya
dc.contributor.supervisor Benkoczi, Robert
dc.contributor.author Purohit, Parijat Prashun
dc.contributor.author University of Lethbridge. Faculty of Arts and Science
dc.date.accessioned 2017-12-01T17:32:41Z
dc.date.available 2017-12-01T17:32:41Z
dc.date.issued 2017
dc.identifier.uri https://hdl.handle.net/10133/4990
dc.description.abstract Given a function promised to be constant or balanced. Deutsch's algorithm and it's extension Deutsch-Jozsa are the algorithms that can determine the property of the function in constant number of queries. The algorithm works only on the functions that are promised to be either constant or balanced. There exist functions that are neither constant nor balanced. Our proposal is to analyze the query complexity of two such functions as a function of some parameter. We apply the methodology to two different problems. We parameterize the degree of imbalance for an arbitrarily chosen function. The same parameterization is used for the functions that are not self-dual. We give global and local adiabatic algorithms for both the problems. Our adiabatic algorithms have smaller query complexity as compared to the deterministic algorithms. en_US
dc.language.iso en_US en_US
dc.publisher Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science en_US
dc.relation.ispartofseries Thesis (University of Lethbridge. Faculty of Arts and Science) en_US
dc.subject adiabatic quantum computation en_US
dc.subject balanced function en_US
dc.subject constant function en_US
dc.subject Deutsch-Jozsa algorithm en_US
dc.subject function self-duality en_US
dc.subject parameterized complexity en_US
dc.title Parameterized query complexity in quantum computation en_US
dc.type Thesis en_US
dc.publisher.faculty Arts and Science en_US
dc.publisher.department Department of Mathematics and Computer Science en_US
dc.degree.level Masters en_US
dc.proquest.subject 0984 en_US
dc.proquestyes Yes en_US
dc.embargo No en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record