This item is under embargo and not available online per the author's request. For access information, please visit


Date of Award

Spring 5-15-2020

Author's School

McKelvey School of Engineering

Author's Department

Computer Science & Engineering

Degree Name

Master of Science (MS)

Degree Type



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).


English (en)


Roman Garnett

Committee Members

Roman Garnett Ron Cytron Marco Pistoia

Available for download on Saturday, October 31, 2020

Included in

Engineering Commons