Quantum Algorithms : A Survey of Applications and End-To-end Complexities by Mario Berta, Chi-Fang Chen, Przemyslaw Bienias, Sam McArdle and Alexander M. Dalzell (2025, Hardcover)
W
warriorssalesgroup (1384)
99.1% positive feedback
Price:
US $107.65
(inclusive of GST)
ApproximatelyS$ 137.03
+ $25.80 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-101009639641
ISBN-139781009639644
eBay Product ID (ePID)13075295151
Product Key Features
Publication NameQuantum Algorithms : a Survey of Applications and End-To-End Complexities
LanguageEnglish
SubjectGeneral
Publication Year2025
TypeTextbook
Subject AreaComputers
AuthorMario Berta, Chi-Fang Chen, Przemyslaw Bienias, Sam Mcardle, Alexander M. Dalzell
FormatHardcover
Dimensions
Item Height0.9 in
Item Length9 in
Item Width6 in
Additional Product Features
Reviews'This timely and forward-looking survey captures the state-of-the-art in quantum computing. Focusing on cutting-edge applications and recent advances in quantum primitives, it serves as an essential resource for understanding the rapidly evolving role of quantum algorithms in scientific discovery.' Lin Lin, University of California, Berkeley
IllustratedYes
Table Of ContentPart I. Areas of Application: 1. Condensed matter physics; 2. Quantum chemistry; 3. Nuclear and particle physics; 4. Combinatorial optimization; 5. Continuous optimization; 6. Cryptanalysis; 7. Solving differential equations; 8. Finance; 9. Machine learning with classical data; Part II. Quantum Algorithmic Primitives: 10. Quantum linear algebra; 11. Hamiltonian simulation; 12. Quantum Fourier transform; 13. Quantum phase estimation; 14. Amplitude amplification and estimation; 15. Gibbs sampling; 16. Quantum adiabatic algorithm; 17. Loading classical data; 18. Quantum linear system solvers; 19. Quantum gradient estimation; 20. Variational quantum algorithms; 21. Quantum tomography; 22. Quantum interior point methods; 23. Multiplicative weights update method; 24. Approximate tensor network contraction; Part III. Fault-Tolerant Quantum Computing: 25. Basics of fault tolerance; 26. Quantum error correction with the surface code; 27. Logical gates with the surface code; Appendix; References; Index.
SynopsisThe 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., This book provides a comprehensive, up-to-date survey of quantum algorithms and how they connect to practical, concrete applications of quantum computing. Its modular, encyclopedic structure facilitates usage as a reference for researchers. This title is also available as Open Access on Cambridge Core.
All listings for this product
Be the first to write a review
