The Joy of Quantum Computing: A Concise Introduction

An engaging and accessible presentation of the most famous algorithms and applications of quantum computing

The Joy of Quantum Computing introduces quantum computing succinctly, and with minimal mathematical formalism. Engagingly written―a feast for the reader’s inner nerd―it presents the most famous algorithms and applications of quantum computing and quantum information science, including the “killer apps,” Grover’s search algorithm, and Shor’s factoring algorithm. The only prerequisite is precalculus; readers need no knowledge of quantum physics. Matrices are relegated to the (completely optional) final two chapters. The book shows readers that quantum information science is about more than just high-speed calculations and data security. It is also about the fundamental meaning of quantum mechanics and the ultimate nature of reality.

The Joy of Quantum Computing is suitable for classroom use or independent study by questing autodidacts.

• Offers detailed explanations of quantum circuits, quantum algorithms, and quantum mysteries
• Explains how to apply quantum information science to cryptography (and how Shor’s algorithm menaces classical cryptography)
• Introduces the mystifying topics of quantum teleportation and the no-cloning theorem
• Discusses Bell inequalities, which permit experimental tests of philosophical assumptions
• Presents a simple model of quantum decoherence, shedding light on Schrödinger’s mysterious cat