秋笛 清石The processing power of widely used silicon-based computers has been increasing exponentially due to steady improvements in nanotechnology.However this exponential growth is not sustainable, as the size of the components will eventually reach the atomic scale, where quantum mechanical effects become significant and the conventional design of computation will no longer work.Quantum computation, on the other hand, makes direct use of quantum mechanical effects to provide a new computational power.Indeed, it has been shown that a large-scale quantum computer can solve the factoring problem (finding the prime factors of large integers) much faster than any foreseeable conventional computers, a problem of the
秋笛 清石The processing power of widely used silicon-based computers has been increasing exponentially due to steady improvements in nanotechnology.However this exponential growth is not sustainable, as the size of the components will eventually reach the atomic scale, where quantum mechanical effects become significant and the conventional design of computation will no longer work.Quantum computation, on the other hand, makes direct use of quantum mechanical effects to provide a new computational power.Indeed, it has been shown that a large-scale quantum computer can solve the factoring problem (finding the prime factors of large integers) much faster than any foreseeable conventional computers, a problem of the
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.
Computers today become faster by becoming smaller. By reducing the size of transistors, engineers are able to fit more of them on a given size microprocessor, thus increasing the processor's computational power. This process cannot continue forever. It has been estimated that sometime within the next two decades, at the current rate, engineers will be faced with the problem of building something that is smaller than an atom. This is as far as our current "classical" computing paradigm will take us. Quantum computing is a potential solution to this problem. This paradigm of computing seeks to directly exploit quantum mechanical phenomena to perform calculations or in some way boost computational efficiency. Some problems can theoretically be solved on a quantum computer exponentially faster than on a classical computer. An overview of the subject is provided here with emphasis on quantum information processing and physical realizations of a quantum computer. Included is a brief history of the subject, a discussion of quantum computing notions such as parallelism and entanglement and their use in quantum algorithms, and conjecture on the prospects and pitfalls of this theory.
Q uantum mechanics has had an enormous technological and societal impact.To grasp this point, it is sufficient to cite the invention of the transistor, perhaps the most remarkable among the countless other applications of quantum mechanics.It is also easy to see the enormous impact of computers on everyday life.The importance of computers is such that it is appropriate to say that we are now living in the information age.This information revolution became possible thanks to the invention of the tran sistor, that is, thanks to the synergy between computer science and quantum physics.Today this synergy offers completely new opportunities and promises exciting advances in both funda mental science and technological application.We are referring here to the fact that quantum mechanics can be used to process and transmit information [1,2].Miniaturization provides us with an intuitive way of under standing why, in the near future, quantum laws will become important for computation.The electronics industry for com puters grows hand-in-hand with the decrease in size of integrated circuits.This miniaturization is necessary to increase computa tional power, that is, the number of floating-point operations per second (flops) a computer can perform.In the 1950's, electronic computers based on vacuum-tube technology were capable of performing approximately 103 floating-point operations per second, while nowadays there exist supercomputers whose power is greater than lOteraflops (1013 flops).As we have remarked, this enormous growth of computational power has been made possi ble owing to progress in m in ia tu riz a tio n , w hich m ay be quantified empirically in Moore's law.This law is the result of a remarkable observation made by Gordon Moore in 1965: the number of transistors on a single integrated-circuit chip doubles approximately every 18 24 months.This exponential growth has not yet saturated and Moore's law is still valid.At the present time the limit is approximately 108 transistors per chip and the typical size of circuit components is of the order of 100 nanometres.Extrapolating Moore's law, one would estimate that around the year 2020 we shall reach the atomic size for storing a single bit of inform atio n .At th a t p o in t, q u a n tu m effects will becom e unavoidably dominant.One should be aware that, besides quantum effects, other fac tors could bring Moore's law to an end.In the first place, there are economic considerations.Indeed, the cost of building fabri cation facilities to m an u factu re chips has also increased exponentially with time.Nevertheless, it is important to under stand the ultimate limitations set by quantum mechanics.Even though we might overcome economic barriers by means of tech nological breakthroughs, quantum physics sets fundamental limitations on the size of the circuit components.The first ques tion under debate is whether it would be more convenient to push References
Richard Feynman's observation that certain quantum mechanical effects cannot be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used these quantum effects. This speculation proved justified when Peter Shor described a polynomial time quantum algorithm for factoring intergers. In quantum systems, the computational space increases exponentially with the size of the system, which enables exponential parallelism. This parallelism could lead to exponentially faster quantum algorithms than possible classically. The catch is that accessing the results, which requires measurement, proves tricky and requires new nontraditional programming techniques. The aim of this paper is to guide computer scientists through the barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding. Various approaches to exploiting the power of quantum parallelism are explained. We conclude with a discussion of quantum error correction.
Silicon has raised an increasing interest in the development of future devices for quantum information processing. Quantum computing consists of the implementation of quantum algorithms on a physical substrate made of interacting qubits, the quantum version of digital bits. Quantum algorithms are those algorithms conceived to solve hard computational problems, such as prime factorization of large integers and minimization of multidimensional functionals based on the encoding of the information by quantum states. Quantum information processing involves all the techniques to process quantum information stored in a physical system from the physical to the virtual layer, the quantum error correction, the logical, and finally the application layer. The power of quantum information processing currently relies mainly on two different quantum computing models. On the one hand, there is universal digital quantum computing, also called circuital quantum computing, based on a set of time-reversible quantum logic ports required to cover the spectrum of all possible unitary operations on the qubits.
This chapter examines the power of quantum computing, as well as the related concepts of quantum cryptography and teleportation. In 1982, the Nobel prize-winning physicist Richard Feynman noticed there was no simple way of simulating quantum physical systems using digital computers. He turned this problem into an opportunity—perhaps a computational device based on quantum mechanics could solve problems more efficiently than more traditional computers. In the decades that followed, computer scientists and physicists, often working together, showed in theory that quantum computers can solve certain problems, such as factoring numbers, much faster. Whether one can actually build large or even medium-scale working quantum computers and determine exactly what these computers can or cannot do still remain significant challenges.