Physics Commons^™

Efficient Quantum Approximation : Examining The Efficiency Of Select Universal Gate Sets In Approximating 1-Qubit Quantum Gates., Brent A. Mode

College of Arts & Sciences Senior Honors Theses

Quantum computation is of current ubiquitous interest in physics, computer science, and the public interest. In the not-so-distant future, quantum computers will be relatively common pieces of research equipment. Eventually, one can expect an actively quantum computer to be a common feature of life. In this work, I study the approximation efficiency of several common universal quantum gate sets at short sequence lengths using an implementation of the Solovay-Kitaev algorithm. I begin by developing from almost nothing the relevant formal mathematics to rigorously describe what one means by the terms universal gate set and covering efficiency. I then describe some …