Quantum Algorithms : A Survey of Applications and End-to-end Complexities

Dalzell, Alexander M. and McArdle, Sam and Berta, Mario and Bienias, Przemyslaw and Chen, Chi-Fang and Gilyén, András Pál and Hann, Connor T. and Kastoryano, Michael J. and Khabiboulline, Emil T. and Kubica, Aleksander and Salton, Grant and Wang, Samson and Brandão, Fernando G. S. L. (2025) Quantum Algorithms : A Survey of Applications and End-to-end Complexities. Cambridge University Press, Cambridge. ISBN 9781009639651; 9781009639644; 9781009639668

Preview

Text Quantum_Algorithms.pdf - Published Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (5MB) | Preview

Abstract

The 1994 discovery of Shor's quantum algorithm for integer factorization—an important practical problem in the area of cryptography—demonstrated quantum computing's potential for real-world impact. Since then, researchers have worked intensively to expand the list of practical problems that quantum algorithms can solve effectively. 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. For each quantum algorithm considered, the book clearly states the problem being solved and the full computational complexity of the procedure, making sure to account for the contribution from all the underlying primitive ingredients. Separately, the book provides a detailed, independent summary of the most common algorithmic primitives. It 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.

Actions (login required)

Edit Item