Modeling quantum circuits

Includes bibliographical references (pages 36-37)Quantum computers will be capable of new modes of computation which today???s computers are not capable of. The quantum theory of computation is the general theory of computation. The Turing model can describe completely the functioning of the existing computers. However, this model is just the classical approximation of the general quantum model.\ud To understand the Quantum Computation we don't need to understand quantum physics in detail. This paper presents some basic notions of quantum theory as the underlying foundation for quantum computing. The purpose of listing these notions is only to show that quantum computing has a solid theoretical foundation in quantum mechanics.\ud Quantum computing basic components are quantum gates that can be used to form quantum circuits. Quantum algorithms are using parallel computation based on quantum entanglement. Because of state superposition a quantum processor can use all input values at the same time. To explore the full potential of quantum parallelism, new algorithms have been expressed mathematically. Although practical quantum computing is still in its early stages, it can represent the future of computation. The application provides means to graphically design a quantum circuit using quantum gates and to simulate a quantum algorithm represented by a quantum circuit. The user can choose a gate or a quantum gate from a list of elements. The gates have a number or a range of input and output pins, and some configurable properties. The user can drag and drop quantum gates to the project panel and connect them with quantum wires. The user will be able to run the circuit and evaluate the results