Angielski
Quantum computing promises to solve problems which are intractable on digital computers. Highly parallel quantum algorithms can decrease the computational time for some problems by many orders of magnitude. This book explains how quantum computers can do these amazing things. Several algorithms are illustrated: the discrete Fourier transform, Shor's algorithm for prime factorization; algorithms for quantum logic gates; physical implementations of quantum logic gates in ion traps and in spin chains; the simplest schemes for quantum error correction; correction of errors caused by imperfect resonant pulses; correction of errors caused by the nonresonant actions of a pulse; and numerical simulations of dynamical behaviour of the quantum Control-Not gate. An overview of some basic elements of computer science are discussed, including the Turing machine, Boolean algebra, and logic gates. The required quantum ideas are explained.
