The Joy of Quantum Computing: A Concise Introduction
The Joy of Quantum Computing introduces quantum computing succinctly, and with minimal mathematical formalism. Engagingly written鈥攁 feast for the reader鈥檚 inner nerd鈥攊t presents the most famous algorithms and applications of quantum computing and quantum information science, including the 鈥渒iller apps,鈥 Grover鈥檚 search algorithm, and Shor鈥檚 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鈥檚 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 Schrodinger鈥檚 mysterious cat