A mathematical model of classical computer was invented by Alan Turing and named “ Turing machine ” model, which is an idealized computer with a simple set of instructions and infinite memories. Soon after Turing’s model was proposed, John von Neumann developed a theoretical model for how to implement all the components in a computer to be fully capable as a Turing machine. In more practical way, we will make use of the circuit model, which is useful also in the study of quantum computation. A circuit may involve many inputs, outputs, many wires and many logic gates. These circuits will be implemented by semi-conductors, which have two functions as conductor and insulator and acts under given conditions as a high-speed switch that leads and stops electricity. Modern computers such as personal computers (PC) use integrated circuits (IC) of semiconductor. While the peculiar feature of semiconductor is based entirely on physics of quantum mechanics, we do not call these computers “quantum computers” but rather called “classical computers”, because logic gates are based on binary representations and any quantum state of atom or molecule is not used as a logic gate: in classical computers, the data are represented by two logical values 0 and 1 in the circuits using devices with high voltage/low voltage, current on/off, and/or direction of magnetization up/down.
A mathematical model of classical computer was invented by Alan Turing and named “ Turing machine ” model, which is an idealized computer with a simple set of instructions and infinite memories. Soon after Turing’s model was proposed, John von Neumann developed a theoretical model for how to implement all the components in a computer to be fully capable as a Turing machine. In more practical way, we will make use of the circuit model, which is useful also in the study of quantum computation. A circuit may involve many inputs, outputs, many wires and many logic gates. These circuits will be implemented by semi-conductors, which have two functions as conductor and insulator and acts under given conditions as a high-speed switch that leads and stops electricity. Modern computers such as personal computers (PC) use integrated circuits (IC) of semiconductor. While the peculiar feature of semiconductor is based entirely on physics of quantum mechanics, we do not call these computers “quantum computers” but rather called “classical computers”, because logic gates are based on binary representations and any quantum state of atom or molecule is not used as a logic gate: in classical computers, the data are represented by two logical values 0 and 1 in the circuits using devices with high voltage/low voltage, current on/off, and/or direction of magnetization up/down.
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. \nTo 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. \nQuantum 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.
The first computer originated as an ordinary calculator in 19th century. Subsequently, the rapid evolution of computers began. The massive amount of processing power generated by computer manufacturers has always failed to quench the thirst for speed and computing capacity. If, as Moore's Law states, the number of transistors on a microprocessor continues to double every 18 months, then soon we will find the circuits on a microprocessor being measured on an atomic scale. Today's advanced lithographic techniques can squeeze fraction of micron wide logic gates and wires onto the surface of silicon chips. Thus it can be seen that very soon we will be facing the need to create quantum computers which can harness the power of atoms and molecules to perform memory and processing tasks. Quantum computers have the potential to perform calculations a billion times faster than any silicon-based computer. Also, theories suggest that every physical object, even the universe, is in some sense a quantum computer. If this is the case, then according to Turing's work which says that all computers are functionally equivalent; computers should be able to model every physical process. Scientists have already built basic quantum computers that can perform certain calculations; but a practical quantum computer is still years away. In this paper, we will be discussing about the history, development and the future scope of quantum computing. The pros and cons of this future technology have also been compared and our analysis has been put forth.
The idea of using quantum mechanics to provide more power than classical computers seem to have begun around 1981 to 1982, but Deutsch put the concept on a sounder footing a short time later. Deutsch reformulated the Turing thesis with the assertion that every finite realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means. However, he asserted that the output of a quantum machine, although fully determined by the input state, is not an observable itself. Progress beyond mathematical approaches came later when Lloyd suggested that arrays of weakly coupled quantum systems might be able to serve as the quantum computer if they were subjected to a sequence of controlled electromagnetic pulses, which could place the quantum bits into the desired super-positions. It was John von Neumann, working with the computer pioneers at the University of Pennsylvania, who suggested that the binary system should be used for simplicity in building computers.
This chapter introduces the basic concepts of computer science that are necessary for an understanding of quantum computation and information. We discuss the Turing machine, the fundamental model of computation since it formalizes the intuitive notion of an algorithm: if there exists an algorithm to solve a given problem, then this algorithm can be run on a Turing machine. We then introduce the circuit model of computation, which is equivalent to the Turing machine model but is nearer to real computers. In this model, the information is carried by wires and a small set of elementary logical operations (gates) allows implementation of any complex computation. It is important to find the minimum resources (computer memory, time and energy) required to solve a given problem with the best possible algorithm. This is the task of computational complexity, for which we provide a quick glance at the key concepts. We also examine the energy resources necessary to perform computations. Here we discuss the relation between energy and information, which was explained by Landauer and Bennett in their solution of Maxwell’s demon paradox. In particular, Landauer’s principle sets the minimum energy requirements for irreversible computation. On the other hand, it turns out that it is, in principle, possible to perform any complex computation by means of reversible gates, without energy dissipation. A concrete model of reversible computation, the so-called billiard-ball computer, is briefly discussed. Finally, we address the problem of energy dissipation in a real computation and show how it may be managed using reversible computation techniques.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.
Universal computing can be dated to 1903 when Alan Turing’s theoretical model of the Turing machine led a large-scale innovative revolution towards digital computing machines.¹ The next milestone is to process and control information at its fundamental level — quantum states of particles. Richard Feynman first pointed out that as certain types of computational problems get more complex, classical bits fail to give efficient answers.² For example, when simulating quantum mechanics, the amount of memory needed to describe a quantum system increases exponentially with the number of its components. A new device — a quantum computer — is therefore highly sought after by physicists.³