Doctor of Philosophy / Electrical and Computer Engineering / Sanjoy Das / Quantum circuit synthesis is one of the major areas of current research in the field of quantum computing. Analogous to its Boolean counterpart, the task involves constructing arbitrary quantum gates using only those available within a small set of universal gates that can be realized physically. However, unlike the latter, there are an infinite number of single qubit quantum gates, all of which constitute the special unitary group SU(2).
Realizing any given single qubit gate using a given universal gate family is a complex task. Although gates can be synthesized to arbitrary degree of precision as long as the set of finite strings of the gate family is a dense subset of SU(2), it is desirable to accomplish the highest level of precision using only the minimum number of universal gates within the string approximation.
Almost all algorithms that have been proposed for this purpose are based on the Solovay-Kitaev algorithm. The crux of the Solovay-Kitaev algorithm is the use of a procedure to decompose a given quantum gate into a pair of group commutators with the pair being synthesized separately. The Solovay-Kitaev algorithm involves group commutator decomposition in a recursive manner, with a direct approximation of a gate into a string of universal gates being performed only at the last level, i.e. in the leaf nodes of the search tree representing the execution of the Solovay-Kitaev algorithm.
The main contribution of this research is in integrating conventional optimization procedures within the Solovay-Kitaev algorithm. Two specific directions of research have been studied. Firstly, optimization is incorporated within the group commutator decomposition, so that a more optimal pair of group commutators are obtained. As the degree of precision of the synthesized gate is explicitly minimized by means of this optimization procedure, the enhanced algorithm allows for more accurate quantum gates to be synthesized than what the original Solovay-Kitaev algorithm achieves. Simulation results with random gates indicate that the obtained accuracy is an order of magnitude better than before.
Two versions of the new algorithm are examined, with the optimization in the first version being invoked only at the bottom level of Solovay-Kitaev algorithm and when carried out across all levels of the search tree in the next. Extensive simulations show that the second version yields better results despite equivalent computation times. Theoretical analysis of the proposed algorithm is able to provide a more formal, quantitative explanation underlying the experimentally observed phenomena.
The other direction of investigation of this research involves formulating the group commutator decomposition in the form of bi-criteria optimization. This phase of research relaxed the equality constraint in the previous approach and with relaxation, a bi-criteria optimization is proposed. This optimization algorithm is new and has been devised primarily when the objective needs to be relaxed in different stages. This bi-criteria approach is able to provide comparably accurate synthesis as the previous approach.
| Identifer | oai:union.ndltd.org:KSU/oai:krex.k-state.edu:2097/19190 |
| Date | January 1900 |
| Creators | Al-Ta'ani, Ola |
| Publisher | Kansas State University |
| Source Sets | K-State Research Exchange |
| Language | en_US |
| Detected Language | English |
| Type | Dissertation |
Page generated in 0.0019 seconds