ORCID
https://orcid.org/0000-0001-7317-2696
Date of Award
Spring 5-15-2020
Degree Name
Master of Science (MS)
Degree Type
Thesis
Abstract
In this work, we explore the challenges faced when creating quantum algorithms for near-term quantum computers. We examine the characteristics of problems that are amenable to such advantage, and the limitations of existing approaches. Additionally, we explore the importance of the classical optimizer in the Variational Quantum Eigensolver (VQE), and propose a Bayesian method to optimally configure a single parameter in a given quantum circuit. Experimental testing confirms that our method is significantly more tolerant to noise than the existing analytical approach and its variants (p < 0.008).
Language
English (en)
Chair
Roman Garnett
Committee Members
Roman Garnett Ron Cytron Marco Pistoia
Comments
Permanent URL: https://doi.org/10.7936/0p21-hp84