Kitaev A.Y., Shen A., Vyalyi M.N. Classical and quantum computation

American Mathematical Society, 2002. — 257 p.An introduction to a rapidly developing topic: the theory of quantum computing. The book begins with the basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm. The second part of the book provides an exposition of quantum computation theory. It starts with the introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Then the authors study various quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem.