Quantum Computing: Lecture Notes

← Back to document page

Quantum computing : Lecture Notes Ronald de Wolf Preface These Lecture Notes were formed in small chunks during my Quantum computing course at the University of Amsterdam, Feb-May 2011, and compiled into one text thereafter. Each chapter was covered in a Lecture of 2 45 minutes, with an additional 45-minute Lecture for exercises and homework. The first half of the course (Chapters 1 7) covers Quantum algorithms, the second half covers Quantum complexity (Chapters 8 9), stuff involving Alice and Bob (Chapters 10 13), and error-correction (Chapter 14). A 15th Lecture about physical implementations and general outlook was more sketchy, and I didn't write Lecture Notes for it. These chapters may also be read as a general introduction to the area of Quantum computation and information from the perspective of a theoretical computer scientist. While I made an effort to make the text self-contained and consistent, it may still be somewhat rough around the edges; I.

quantum algorithms that are significantly faster than any classical algorithm solving the same problem. The field started in the early 1980s with suggestions for analog quantum computers by

  Computing, Quantum, Quantum computing