Cambridge ; New York : Cambridge University Press, 2007.
xiv, 220 p. : ill. ; 26 cm.
Includes bibliographical references and index.
Preface-- 1. Cbits and Qbits-- 2. General features and some simple examples-- 3. Breaking RSA encryption with a quantum computer-- 4. Searching with a quantum computer-- 5. Quantum error correction-- 6. Protocols that use just a few Qbits-- Appendices-- Index.
(source: Nielsen Book Data)
In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction. The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. It evolved during six years of teaching the subject to undergraduates and graduate students in computer science, mathematics, engineering, and physics, at Cornell University. (source: Nielsen Book Data)