| Softcover ISBN: | 978-1-4704-7398-3 |
| Product Code: | AMSTEXT/64 |
| List Price: | $89.00 |
| MAA Member Price: | $80.10 |
| AMS Member Price: | $71.20 |
| eBook ISBN: | 978-1-4704-7652-6 |
| Product Code: | AMSTEXT/64.E |
| List Price: | $85.00 |
| MAA Member Price: | $76.50 |
| AMS Member Price: | $68.00 |
| Softcover ISBN: | 978-1-4704-7398-3 |
| eBook: ISBN: | 978-1-4704-7652-6 |
| Product Code: | AMSTEXT/64.B |
| List Price: | $174.00 $131.50 |
| MAA Member Price: | $156.60 $118.35 |
| AMS Member Price: | $139.20 $105.20 |
| Softcover ISBN: | 978-1-4704-7398-3 |
| Product Code: | AMSTEXT/64 |
| List Price: | $89.00 |
| MAA Member Price: | $80.10 |
| AMS Member Price: | $71.20 |
| eBook ISBN: | 978-1-4704-7652-6 |
| Product Code: | AMSTEXT/64.E |
| List Price: | $85.00 |
| MAA Member Price: | $76.50 |
| AMS Member Price: | $68.00 |
| Softcover ISBN: | 978-1-4704-7398-3 |
| eBook ISBN: | 978-1-4704-7652-6 |
| Product Code: | AMSTEXT/64.B |
| List Price: | $174.00 $131.50 |
| MAA Member Price: | $156.60 $118.35 |
| AMS Member Price: | $139.20 $105.20 |
-
Book DetailsPure and Applied Undergraduate TextsVolume: 64; 2024; 371 ppMSC: Primary 11; 68; 81; 94
Introduction to Quantum Algorithms offers a mathematically precise exploration of the topic, accessible to those with a basic mathematical university education, while also catering to more experienced readers. This comprehensive book is suitable for self-study or as a textbook for introductory courses on quantum computing algorithms.
Ancillaries:
ReadershipUndergraduate and graduate students and researchers interested in learning the foundations of quantum computing.
-
Table of Contents
-
Classical computation
-
Hilbert spaces
-
Quantum mechanics
-
The theory of quantum algorithms
-
The algorithms of Deutsch and Simon
-
The algorithms of Shor
-
Quantum search and quantum counting
-
The HHL algorithm
-
Foundations
-
Linear algebra
-
Probability theory
-
Solutions of selected exercises
-
Bibliography
-
Index
-
-
Additional Material
-
Reviews
-
Johannes Buchmann's Introduction to Quantum Algorithms...is well-suited to teach this delightful subject to mathematics majors in a rigorous way. Using the book effectively requires students to have successfully completed a proof-based linear algebra course and to have an appetite for rigorous mathematics. However, the book requires very little in the way of nonmathematical prerequisites; background concepts from computer science and physics, including a precise mathematical formulation of quantum mechanical postulates, are given thorough treatment in the first chapters of the book. Throughout the book, Buchmann maintains a solidly mathematical perspective and a high level of rigor. This will appeal to math professors and serious math students alike.
Jamie Pommersheim, Notices of the AMS
-
-
RequestsReview Copy – for publishers of book reviewsDesk Copy – for instructors who have adopted an AMS textbook for a courseInstructor's Solutions Manual – for instructors who have adopted an AMS textbook for a courseExamination Copy – for faculty considering an AMS textbook for a courseAccessibility – to request an alternate format of an AMS title
- Book Details
- Table of Contents
- Additional Material
- Reviews
- Requests
Introduction to Quantum Algorithms offers a mathematically precise exploration of the topic, accessible to those with a basic mathematical university education, while also catering to more experienced readers. This comprehensive book is suitable for self-study or as a textbook for introductory courses on quantum computing algorithms.
Ancillaries:
Undergraduate and graduate students and researchers interested in learning the foundations of quantum computing.
-
Classical computation
-
Hilbert spaces
-
Quantum mechanics
-
The theory of quantum algorithms
-
The algorithms of Deutsch and Simon
-
The algorithms of Shor
-
Quantum search and quantum counting
-
The HHL algorithm
-
Foundations
-
Linear algebra
-
Probability theory
-
Solutions of selected exercises
-
Bibliography
-
Index
-
Johannes Buchmann's Introduction to Quantum Algorithms...is well-suited to teach this delightful subject to mathematics majors in a rigorous way. Using the book effectively requires students to have successfully completed a proof-based linear algebra course and to have an appetite for rigorous mathematics. However, the book requires very little in the way of nonmathematical prerequisites; background concepts from computer science and physics, including a precise mathematical formulation of quantum mechanical postulates, are given thorough treatment in the first chapters of the book. Throughout the book, Buchmann maintains a solidly mathematical perspective and a high level of rigor. This will appeal to math professors and serious math students alike.
Jamie Pommersheim, Notices of the AMS
