This thesis develops a graphical integrated development environment for quantum algorithms.It defines a graphical representation based on the quantum gate model.This graphical model can then be translated to a quantum programming language or any other intermediate form that a quantum simulator or quantum computer understands.After execution the results and intermediate steps are displayed in the development environment.The developed environment can be used in the fields of education and research to deepen the understanding of how quantum algorithms work.
This thesis develops a graphical integrated development environment for quantum algorithms.It defines a graphical representation based on the quantum gate model.This graphical model can then be translated to a quantum programming language or any other intermediate form that a quantum simulator or quantum computer understands.After execution the results and intermediate steps are displayed in the development environment.The developed environment can be used in the fields of education and research to deepen the understanding of how quantum algorithms work.
This thesis presents the architecture of quantum programming environment, called QSI, along with its related modules and several quantum experiments. The environment is based on one specific quantum language, namely quantum while-language. Some partial experimental results are also presented within QSI.
The first part relates to the architecture, the designing and the implementation of quantum programming environment which provides a new, powerful and flexible environment for developing and implementing quantum programs. First, we study the possible structure of the programming environment which supports a measurement-based case statement and a measurement-based while-loop. These two program constructs are extremely convenient for describing large-scale quantum algorithms, such as quantum random walk-based algorithms. We also define a new assembly language called f-QASM (Quantum Assembly Language with feedback) as an interactive command set. The assembly language is compatible with other low-level instruction sets and can be used to directly drive quantum hardware. Moreover, the simulation of syntax of quantum program and the behaviours within the architecture on the classical computer are discussed. Finally, we consider the work-flow which contains the decomposition of unitary matrix to achieve the goal that executing on Noisy Intermediate-Scale Quantum Computer.
The second part concerns the modules based on quantum programming environment: termination analysis module, detective separable unitary module and quantum control module. Along with the architecture, we bring an essential module - termination analysis module for the loop structure. It can analyze sub-bodies of quantum program and suggest the critical termination information. In addition, we improve the Jordan decomposition step in the original algorithm which consumes extended period for analyzing. This improvement also makes the module more robust on executing. A fast permutation algorithm module clarifies the re-ordering algorithm in case of qubits system. It regenerates the program (unitary operator) which is not in pre-ordered sequence. In the detective separable unitary module, we prove sufficient conditions for separable unitary and its approximate scenario. The result shows there does not exist a universal algorithm for potential parallel executing quantum programs without communications (classical or quantum communications). However, in approximate, there exists a scheme for parallel computing without the help of communication. In this part, two examples for parallel computing are given. Last, in quantum control module, an algorithm is suggested towards automatically generating quantum circuits for quantum case-statement. We believe these analysis modules can help the compiler to optimize the implementation of quantum algorithms.
The third part is devoted to quantum experiment. First, we focus several experiments which can be operated directly by QSI : Qloop, BB84 protocol and Grover search algorithm. After that, with the help of IBM’s QISKit,…
In this paper, we analyze existing quantum computer simulation techniques and their realizations to minimize the impact of the exponential complexity of simulated quantum computations. As a result of this investigation, we propose a quantum computer simulator with an integrated development environment – QuIDE – supporting the development of algorithms for future quantum computers. The simulator simplifies building and testing quantum circuits and understanding quantum algorithms in an efficient way. The development environment provides flexibility of source code edition and ease of the graphical building of circuit diagrams. We also describe and analyze the complexity of algorithms used for simulation as well as present performance results of the simulator as well as results of its deployment during university classes.
The rapid progress quantum devices have made in recent years has led to the need for systems that bridge the gap between quantum algorithms and quantum hardware. To this purpose different full-stack quantum programming platforms have been developed, providing high level languages for expressing quantum algorithms and providing compilers for making those quantum algorithms executable on a given quantum device. OpenQL is one such a platform, with support for compiling a variety of quantum program inputs into a quantum circuit, ready to be executed on the targeted quantum hardware. OpenQL is an evolving tool in which new features are constantly added to improve its performance and extend its functionality. In order to enhance OpenQL and provide some extra support to the researchers using OpenQL for their experiments, a visualization tool with three main functionalities has been developed in this thesis project. First, a circuit visualizer, with support for both visualizing the circuit output of the OpenQL compiler as an abstract gate representation and a pulse representation, which has been made specifically for quantum hardware running on superconducting qubits. Secondly, a mapping graph visualizer, which allows displaying the logical to physical qubit mapping per program cycle. And lastly a qubit interaction graph generator, which shows the required interactions between qubits of a given quantum algorithm.
A quantum computer simulator is presented. This simulator is an engineering work and no deep understanding of quantum mechanics is required from the user. The simulator is based on the circuit model of quantum computation in which quantum gates act on quantum registers which comprise a number of quantum bits (qubits). The inputs to the simulator are the initial states of the qubits that form a quantum register and the quantum gates applied at each computation step. The inputs are entered through a graphical user interface. The outputs of the simulator are the matrices that represent the quantum register state at each quantum computation step and graphical outputs that show the probability of measuring each one of the possible quantum register base states and the phase of each state at each computation step. The well-known Deutsch's algorithm and the quantum Fourier transform, which is the base of many quantum algorithms, are presented using this simulator. Furthermore, the generation and variation of entanglement during quantum computations can be calculated using this simulator. The quantum computer simulator is a useful tool for the study of quantum computer circuits, quantum computing, and the development of new quantum algorithms.
A general quantum simulation language on a classical computer provides the opportunity to compare an experiential result from the development of quantum computers with mathematical theory. The intention of this research is to develop a program language that is able to make simulations of all quantum algorithms in same framework. This study examines the simulation of quantum algorithms on a classical computer with a symbolic programming language. We use the language Mathematica to make simulations of well-known quantum algorithms. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. This gives us an uncomplicated and clear language for the implementations of algorithms. The computational language includes essential formulations such as quantum state, superposition and quantum operator. This symbolic programming language provides a universal framework for examining the existing as well as future quantum algorithms. This study contributes with an implementation of a quantum algorithm in a program code where the substance is applicable in other simulations of quantum algorithms.
This paper describes a detailed analysis of the fundamental components involved in the quantum algorithms design in accordance with the narrowly defined software and hardware for the implementation of quantum algorithms and the stages of their design. A modular development and subsequent simulation of the process of super dense quantum coding and quantum teleportation was realized. In accordance with the use of vector and matrix algebra, within the framework of quantum algorithms, the “quantum” software is defined. This software consists of quantum intermediate representation of information, quantum language of physical operations and quantum assembler. The software environment for quantum algorithms design and further implementation according to the defined stages is proposed and considered.