Quantum Computing

Mika Hirvensalo maps out the new multidisciplinary research area of quantum computing. The text contains an introduction to quantum computing as well as the most important recent results on the topic. Two famous algorithms, fast factorization and Grover search, are presented in separate chapters because these inventions are important structurally and developmentally. The presentation of the topic is uniform and computer science-oriented. Thus, the book differs from most of the previous ones which are mainly physics-oriented. The special style of presentation makes the theory of quantum computing accessible to a larger audience, including also the mathematics-oriented oriented readers. Many examples and exercises ease the understanding.

Compared to the previous edition, a new chapter on quantum information has been added and numerous corrections, amendments, and extensions have been incorporated throughout the entire text.

Contenu
1.Introduction.- 2.Quantum Information.- 3. Devices for Computation.- 4. Fast Factorization.- 5. Finding the Hidden Subgroup.- 6. Grover's Search Algorithm.- 7. Complexity Lower Bounds for Quantum Circuits.- 8. Appendix A: Quantum Physics.- 9. Appendix B: Mathematical Background.- References.