Quantum Computer Science: An Introduction

Quantum Computer Science: An Introduction by N. David Mermin presents the foundations of quantum computation from a computer science perspective. The book is designed primarily for readers without prior knowledge of quantum physics, making it particularly accessible to computer science students. It begins by introducing classical bits and quantum bits, reversible operations, quantum gates, circuit diagrams, and the principles of quantum measurement. The book then explores the general structure of quantum computation through several fundamental examples of quantum algorithms, including Deutsch's, Bernstein–Vazirani, and Simon's algorithms. It subsequently examines Shor's factoring algorithm and its implications for RSA cryptography, followed by Grover's quantum search algorithm. These examples illustrate how quantum computation can offer computational advantages over classical approaches for particular problems. Further chapters address quantum error correction, including five-qubit and seven-qubit error-correcting codes, as well as quantum information protocols involving a small number of qubits. Topics include Bell states, quantum cryptography, bit commitment, quantum dense coding, quantum teleportation, and the GHZ paradox. Overall, the book provides a concise yet substantial introduction to the theoretical foundations and major applications of quantum computer science