This book is about quantum computing and quantum algorithms. The book starts with a chapter introducing the basic rules of quantum mechanics and how they can be used to build quantum circuits and perform computations.
Further, Grover's algorithm is presented for unstructured search discussing its consequences and applications.
Next, important techniques are discussed such as Quantum Fourier Transform and quantum phase estimation. Finally, Shor's algorithm for integer factorization is explained.
At last, quantum walks are explained in detail covering both the discrete and continuous time models,
and applications of this techniques are described for the design and analyses of quantum algorithms.
1. Introduction.- 2. Bits and Qubits.- 3. Grovers Algorithm for Unstructured Search.- 4. Shors Algorithm for Integer Factorization.- 5. Quantum Walks.- 6. Conclusion and further remarks.- Index.-
The authors provide enough material for students of computer science and mathematics to learn the basic rules of quantum mechanics. The authors also provide enough information for students of physics and engineering to understand the basic concepts of algorithm design and its analysis. There are many interesting quantum algorithms worth learning. & This book is written in a way that is easy to read. It is suitable for beginners who are interested in learning quantum algorithms. (D. J. Guan, Mathematical Reviews, May, 2020)
This simple yet practical first contact with quantum computing is well written, easy to read, and well structured. & the book is exceptionally interesting for people in CS who want to understand the basic notions behind quantum computing. (Santiago Escobar, Computing Reviews, October 09, 2019)
![A Primer on Quantum Computing [Paperback]](/itemImage/2/8/9/4/2_3201498.jpg "A Primer on Quantum Computing [Paperback]")