Introduction To Quantum Algorithms

Description

By (author) Buchmann Johannes A.

Short /annotation:
The theory of quantum algorithms is based on advanced concepts from computer science, mathematics, and physics. This book offers a mathematically precise exploration of these concepts, accessible to those with a basic mathematical university education, while also catering to more experienced readers.

:
Quantum algorithms are among the most important, interesting, and promising innovations in information and communication technology. They pose a major threat to today”s cybersecurity and at the same time promise great benefits by potentially solving previously intractable computational problems with reasonable effort. The theory of quantum algorithms is based on advanced concepts from computer science, mathematics, and physics. Introduction to Quantum Algorithms offers a mathematically precise exploration of these concepts, 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 one- or two-semester introductory courses on quantum computing algorithms. Instructors can tailor their approach to emphasize theoretical understanding and proofs or practical applications of quantum algorithms, depending on the course”s goals and timeframe.

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

Biographical note:

Johannes A. Buchmann, Technical University of Darmstadt, Germany.