Quantum Algorithms

CPSC 440/640, Course Information, Fall 2012


Office hours: Monday 2:00-3:00, Tuesday 2:00-3:00, or by appointment
Instructor: Prof. Dr. Andreas Klappenecker

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.

Quantum computing is not difficult, but simply different!

General Information

Textbook and Lecture Notes

Homework

Schedule

M Aug 27 Introduction
W Aug 29 Quantum Key Distribution
F Aug 31 Quantum Circuits
M Sep 03 Quantum Circuits
W Sep 05 Quantum Circuits, Tensor Products
F Sep 07 Quantum Circuits, Teleportation
M Sep 10 Teleportation, Deutsch's Problem
W Sep 12 Deutsch's Problem
F Sep 14 Quantum Search for two Qubits
M Sep 17 Controlled Unitary Gates
W Sep 19 Controlled Unitary Gates
F Sep 21 Controlled Unitary Gates
M Sep 24 Multiple Control Unitary Gates
W Sep 26 Universality
F Sep 28 Universality, Quantum Circuit Simulator
M Oct 29 Shor's factoring algorithm
W Oct 31 Shor's factoring algorithm
F Nov 2 Shor's factoring algorithm, Continued Fractions
M Nov 5 Shor's factoring algorithm, Continued Fractions
F Nov 7 Shor's factoring algorithm, Continued Fractions
F Nov 9 Continued Fractions
M Nov 12 Stabilizer codes
W Nov 14 Stabilizer codes
F Nov 16 Stabilizer codes


Copyright 2012 by Andreas Klappenecker, Texas A&M University.
Back to Andreas Klappenecker's home page.