Quantum Algorithms

CPSC 640, Course Information, Spring 2005

This course gives a self-contained introduction to quantum algorithms, one of the most exciting recent developments in computer science. We do not expect any background knowledge in quantum computing nor in quantum physics. You should know how to multiply a matrix with a vector, but the most important prerequisite is simply an open mind.

General Information

• Syllabus

Homework

• Problem Set 1
• Problem Set 2 Alfred
• Problem Set 3
• Problem Set 4
• Project Assignments

Lecture Notes

• Chapters 1-3

Some Features of the Course

• The approach is algorithmic.
  (After 2-3 weeks you will know the basics of the computing model)
• You will complete a simulator of a quantum computer
  (a surprisingly simple task, since I provide a comprehensive framework)
• You will get a comprehensive overview of many quantum algorithms and protocols
• We will dispell the myths that a quantum computer cannot be built.
• We discuss the ingredients of a quantum internet.

Textbook

• Required text: M. Nielson and I. Chuang: Quantum Computation and Quantum Information, Cambridge University Press, 2000.
• Recommended text: J. Stolze and D. Suter: Quantum Computing - A Short Course from Theory to Experiment, Wiley-VCH, 2004
• I will provide lecture notes that will make the fundamental concepts accessible.
• I will provide some notes about linear algebra and other mathematical concepts that will be needed.

Don't be fooled! Although the word quantum appears in the title of the course, this does not mean that you have to know quantum mechanics nor does it mean that the course will be particularly difficult.