Ever since Shor's quantum algorithm for factoring integers was discovered three decades ago, showing that quantum algorithms could solve a problem relevant to everyday cryptography, researchers have been working to expand the list of real-world problems to which quantum computing can be applied. This book surveys the fruits of this effort, covering proposed quantum algorithms for concrete problems in many application areas, including quantum chemistry, optimization, finance, and machine learning. The book clearly states the problem being solved and the full computational complexity of the quantum algorithm, making sure to account for the contribution from all the underlying primitive ingredients. Separately, the book also provides a detailed, independent summary of the most common algorithmic primitives. The book has a modular, encyclopedic format to facilitate navigation of the material, and to provide a quick reference for designers of quantum algorithms and quantum computing researchers. This title is also available as open access on Cambridge Core.