Dalhousie Repository

OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM COMPUTATION

DalSpace/Manakin Repository

Show simple item record

dc.contributor.author Yousefabadi, Navid
dc.date.accessioned 2011-12-16T19:54:47Z
dc.date.available 2011-12-16T19:54:47Z
dc.date.issued 2011-12-16
dc.identifier.uri http://hdl.handle.net/10222/14381
dc.description.abstract Shor’s algorithm shows that circuit-model quantum computers can factorize integers in polynomial time – exponentially more efficiently than classical computers. There is currently no analogous algorithm for Adiabatic Quantum Computers(AQCs). We illustrate through a number of factorization problems that a naive AQC implemen- tation fails to reveal an exponential speed up. An exponential speed up does become evident with the optimization of the AQC evolution path utilizing existing optimisa- tion approaches. We reduce the computation time even further by optimization over heuristically-derived parametrised functions. Finally, we improve our own results by exploring two-dimensional paths, and give arguments that using more dimensions in the search space can enhance the computational power to an even greater extent. en_US
dc.language.iso en en_US
dc.subject Adiabatic Quantum Computing en_US
dc.title OPTIMAL ANNEALING PATHS FOR ADIABATIC QUANTUM COMPUTATION en_US
dc.date.defence 2011-12-09
dc.contributor.department Department of Physics & Atmospheric Science en_US
dc.contributor.degree Master of Science en_US
dc.contributor.external-examiner Andrew D. Rutenberg en_US
dc.contributor.graduate-coordinator Randall Martin en_US
dc.contributor.thesis-reader Kimberley C. Hall en_US
dc.contributor.thesis-supervisor Jordan Kyriakidis en_US
dc.contributor.ethics-approval Not Applicable en_US
dc.contributor.manuscripts Not Applicable en_US
dc.contributor.copyright-release Not Applicable en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record