الفهرس 
AbstractOnly 14 pages are availabe for public view
 |  | from | 159 |  |  |
| | | from | 159 | | |
Abstract
In the last decade, the field of quantum computing has raised large interest among physicists, mathematicians and computer scientists due to the capability of solving hard problems exponentially faster than with the familiar classical computers. Many research areas in this field has been raised since the first quantum processor was build. Building a complete quantum compiler is one of these challenges that faces computer scientists, as the physical implementation of quantum computers is not yet clear which physical technology will be the most successful. This has an effect on programming language and compiler design; any given implementation technology may have a preferred set of operators and measurements that are easiest to implement. Accordingly, it may be necessary to develop a range of programming language features designed to exploit the preferred operations of different implementation schemes. Alternatively, it may be necessary to develop program transformation techniques that can shift from one implementation style to another.The research community asked a question ”can a quantum computer be programmed without the need of learning the horrible quantum computing details?” In fact, it is a great challenging task for the quantum software engineers to determine which portions of a classical program are good candidates for quantum acceleration. Also, the optimization of hybrid programs is a big challenge that should be addressed before the deployment of quantum computers. from a broader perspective, our research can be defined as an attempt to force these challenges and build an intelligent and complete quantum compiler that can achieve the requirements raised by the previous question. This thesis introduces a novel strategy for build an intelligent and complete quantum compiler, the proposed strategy depends on separating the programmer from the horrible quantum computing details. The proposed quantum compiler consists of three main stages; the preparation, the evolving stage and the compilation stage. Verification and validation processes had been performed. Experimental results had shown that the algorithms and techniques used to construct this compiler satisfies the main objectives of this research with high fidelity.