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

Dalzell, Alexander M.; McArdle, Sam; Berta, Mario; Bienias, Przemyslaw; Chen, Chi-Fang; Gilyén, András; Hann, Connor T.; Kastoryano, Michael J.; Khabiboulline, Emil T.; Kubica, Aleksander; Salton, Grant; Wang, Samson; Brandão, Fernando G. S. L.

ISBN 10: 1009639641 / ISBN 13: 9781009639644

Published by Cambridge University Press, 2025

About this Item

In.

Seller Inventory # ria9781009639644_new

Bibliographic Details

• Title: Quantum Algorithms: A Survey of Applications and End-to-end Complexities
• Publisher: Cambridge University Press
• Publication Date: 2025
• Language: English
• ISBN 10: 1009639641
• ISBN 13: 9781009639644
• Binding: Hardcover
• Condition: New

About this title

Synopsis

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.