The Best Quantum Algorithms Books of All Time

This introduction to quantum computing from a classical programmer's perspective is meant for students and practitioners alike. Over 25 fundamental algorithms are explained with full mathematical derivations and classical code for simulation, using an open-source code base developed from the ground up in Python and C++. After presenting the basics of quantum computing, the author focuses on algorithms and the infrastructure to simulate them efficiently, beginning with quantum teleportation, superdense coding, and Deutsch-Jozsa.

Coverage of advanced algorithms includes the quantum supremacy experiment, quantum Fourier transform, phase estimation, Shor's algorithm, Grover's algorithm with derivatives, quantum random walks, and the Solovay–Kitaev algorithm for gate approximation. Quantum simulation is explored with the variational quantum eigensolver, quantum approximate optimization, and the Max-Cut and Subset-Sum algorithms. The book also discusses issues around programmer productivity, quantum noise, error correction, and challenges for quantum programming languages, compilers, and tools, with a final section on compiler techniques for transpilation.

Quantum computers are poised to kick-start a new computing revolution―and you can join in right away. If you’re in software engineering, computer graphics, data science, or just an intrigued computerphile, this book provides a hands-on programmer’s guide to understanding quantum computing. Rather than labor through math and theory, you’ll work directly with examples that demonstrate this technology’s unique capabilities. Quantum computing specialists Eric Johnston, Nic Harrigan, and Mercedes Gimeno-Segovia show you how to build the skills, tools, and intuition required to write quantum programs at the center of applications.

You’ll understand what quantum computers can do and learn how to identify the types of problems they can solve. This book includes three multichapter sections: Programming for a QPU―Explore core concepts for programming quantum processing units, including how to describe and manipulate qubits and how to perform quantum teleportation. QPU Primitives―Learn algorithmic primitives and techniques, including amplitude amplification, the Quantum Fourier Transform, and phase estimation. QPU Applications―Investigate how QPU primitives are used to build existing applications, including quantum search techniques and Shor’s factoring algorithm.

Quantum algorithms are among the most important, interesting, and promising innovations in information and communication technology. They pose a major threat to today's cybersecurity and at the same time promise great benefits by potentially solving previously intractable computational problems with reasonable effort. The theory of quantum algorithms is based on advanced concepts from computer science, mathematics, and physics.

Introduction to Quantum Algorithms offers a mathematically precise exploration of these concepts, accessible to those with a basic mathematical university education, while also catering to more experienced readers. This comprehensive book is suitable for self-study or as a textbook for one- or two-semester introductory courses on quantum computing algorithms. Instructors can tailor their approach to emphasize theoretical understanding and proofs or practical applications of quantum algorithms, depending on the course's goals and timeframe.