First Advisor

Marek Perkowski

Date of Publication


Document Type


Degree Name

Doctor of Philosophy (Ph.D.) in Electrical and Computer Engineering


Electrical and Computer Engineering




Quantum logic, Machine learning, Logic programming, Quantum computers



Physical Description

1 online resource (399 p.)


Since Quantum Computer is almost realizable on large scale and Quantum Technology is one of the main solutions to the Moore Limit, Quantum Logic Synthesis (QLS) has become a required theory and tool for designing Quantum Logic Circuits. However, despite its growth, there is no any unified aproach to QLS as Quantum Computing is still being discovered and novel applications are being identified.

The intent of this study is to experimentally explore principles of Quantum Logic Synthesis and its applications to Inductive Machine Learning. Based on algorithmic approach, I first design a Genetic Algorithm for Quantum Logic Synthesis that is used to prove and verify the methods proposed in this work.

Based on results obtained from the evolutionary experimentation, I propose a fast, structure and cost based exhaustive search that is used for the design of a novel, least expensive universal family of quantum gates.

The results form both the evolutionary and heuristic search are used to formulate an Inductive Learning Approach based on Quantum Logic Synthesis with the intended application being the humanoid behavioral robotics.

The presented approach illustrates a successful algorithmic approach, where the search algorithm was able to invent/discover novel quantum circuits as well as novel principles in Quantum Logic Synthesis.


In Copyright. URI: This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).


If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to and include clear identification of the work, preferably with URL

Persistent Identifier