For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

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 important 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 behavior of the quantum Control-Not gate. An overview of some basic elements of computer science is presented, including the Turing machine, Boolean algebra, and logic gates. The required quantum ideas are explained.

**Sample Chapter(s)**

Chapter 1: Introduction (588 KB)

Chapter 2: The Turing Machine (171 KB)

- The Turing Machine
- Binary System and Boolean Algebra
- The Quantum Computer
- The Discrete Fourier Transform
- Quantum Factorization of Integers
- Logic Gates
- Implementation of Logic Gates Using Transistors
- Reversible Logic Gates
- Quantum Logic Gates
- Two and Three Qubit Quantum Logic Gates
- One-Qubit Rotation
*A*-Transformation_{j}*B*-Transformation_{jk}- Unitary Transformations and Quantum Dynamics
- Quantum Dynamics at Finite Temperature
- Physical Realization of Quantum Computations
- CONTROL-NOT Gate in an Ion Trap
*A*and_{j}*B*Gates in an Ion Trap_{jk}- Linear Chains of Nuclear Spins
- Digital Gates in a Spin Chain
- Non-resonant Action of π-Pulses
- Experimental Logic Gates in Quantum Systems
- Error Correction for Quantum Computers
- Quantum Gates in a Two-Spin System
- Quantum Logic Gates in a Spin Ensemble at Room Temperature
- Evolution of Four-Spin Molecules
- Getting the Desired Density Matrix

**Sample Chapter(s)**

Chapter 1: Introduction (588k)

Chapter 2: The Turing Machine (171k)