Quantum computing for programmers

"This introduction to quantum computing from a classical programmer's perspective is meant for students and practitioners alike. More than 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"--

Cover -- Half-title -- Title page -- Copyright information -- Contents -- Acknowledgments -- Introduction -- 1 The Mathematical Minimum -- 1.1 Complex Numbers -- 1.2 Dirac Notation, Bras, and Kets -- 1.3 Tensor Product -- 1.4 Unitary and Hermitian Matrices -- 1.5 Hermitian Adjoint of Expressions -- 1.6 Eigenvalues and Eigenvectors -- 1.7 Trace of a Matrix -- 2 Quantum Computing Fundamentals -- 2.1 Tensors -- 2.2 Qubits -- 2.3 States -- 2.4 Helper Functions -- 2.5 Operators -- 2.6 Single-Qubit Gates -- 2.7 Controlled Gates -- 2.8 Quantum Circuit Notation -- 2.9 Bloch Sphere

2.10 Global Phase -- 2.11 Entanglement -- 2.12 No-Cloning Theorem -- 2.13 Uncomputation -- 2.14 Reduced Density Matrix and Partial Trace -- 2.15 Measurement -- 3 Simple Algorithms -- 3.1 Random Number Generator -- 3.2 Gate Equivalences -- 3.3 Classical Arithmetic -- 3.4 Swap Test -- 3.5 Quantum Teleportation -- 3.6 Superdense Coding -- 3.7 Bernstein-Vazirani Algorithm -- 3.8 Deutsch's Algorithm -- 3.9 Deutsch-Jozsa Algorithm -- 4 Scalable, Fast Simulation -- 4.1 Simulation Complexity -- 4.2 Quantum Registers -- 4.3 Circuits -- 4.4 Fast Gate Application -- 4.5 Accelerated Gate Application

4.6 Sparse Representat…