It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.
It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.
Quantum computing represents one of the most profound technological and intellectual advances of the twenty-first century. Rooted in the principles of quantum mechanics and enriched by developments in computer science, mathematics, and engineering, quantum computing offers fundamentally new ways of processing information. By exploiting phenomena such as superposition, entanglement, and quantum interference, quantum computers promise to solve certain classes of problems that remain intractable for even the most powerful classical machines.
If the bits of computers are someday scaled down to the size of individual atoms, quantum mechanical effects may profoundly change the nature of computation itself. The wave function of such a quantum computer could consist of a superposition of many computations carried out simultaneously; this kind of parallelism could be exploited to make some important computational problems, like the prime factoring of large integers, tractable. However, building such a quantum computer would place undreamed of demands on the experimental realization of highly quantum-coherent systems; present-day experimental capabilities in atomic physics and other fields permit only the most rudimentary implementation of quantum computation.
Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.
Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.
The principles of quantum computing were laid out about 15 years ago by computer scientists applying the superposition principle of quantum mechanics to computer operation. Quantum computing has recently become a hot topic in physics, with the recognition that a two-level system can be presented as a quantum bit, or “qubit,” and that an interaction between such systems could lead to the building of quantum gates obeying nonclassical logic. (See PHYSICS TODAY, October 1995, page 24 and March 1996, page 21.)
Quantum mechanics is one of the cornerstones of modern physics. It governs the behavior and the properties of matter in a fundamental way, in particular on the microscopic scale of atoms and molecules. Hence, what we may call a classical computer, i.e., those machines on or under the desktops in our offices together with all their potential descendants, are themselves following the rules of quantum mechanics. However, they are no quantum computers in the sense that all the inside information processing can perfectly be described within classical information theory. In fact, we do not need quantum mechanics in order to explain how the zeros and ones – the bits – inside a classical computer evolve. The reason for this is that the architecture of classical computers does not make use of one of the most fundamental features of quantum mechanics, namely the possibility of superpositions. Throughout the entire processing of any program on a classical computer, each of the involved bits takes on either the value zero or one. Quantum mechanics, however, would in addition allow superpositions of zeros one ones, that is bits – now called qubits (quantum-bits) – which are somehow in the state zero and one at the