Special Topics in Algorithmic Aspects of Quantum Computing
Fall 2001
Course Information
Instructor: Andreas Klappenecker
Where: HRBB, Room 126
When: MWF 9:10am-10:00am
Office: HRBB, Room 509B
Office Hours: MW 10:15am-11:15am or by appointment
Prerequisite
Programming skills and basic linear algebra.
Required Textbook:
Further Information
- J. Gruzka: Quantum Computing, McGraw-Hill, 1999.
- A.O. Pittenger: An Introduction to Quantum Computing Algorithms,
Birkhäuser, 2000.
- Useful resource: http://xxx.lanl.gov/archive/quant-ph
Additional materials will be distributed during the course.
Grades
- Midterm exam: 25%
- Final term project: 25%
- Assignments: 40%
- Culture: 10%
The course grades will be assigned according to the
scale A=90-100%, B=80-89%, C=70-79%, D=60-69%, F 0-59% of the total points
available.
Course Goals
The course gives an introduction to algorithmic aspects of quantum computing. It will cover the quantum circuit model, basic algorithms, and new design methods for quantum circuits. At the end of the course, you should be familiar with
- the quantum circuit model,
- basic quantum algorithms covered in the course,
- design methods for quantum algorithms,
- quantum error control codes and fault-tolerant computations,
- some results in quantum complexity theory.
Course Contents
A (tentative) list of topics that will be covered in the
course:
- Basic Algorithms of Quantum Computing
- Teleportation
- Simulation of a Quantum Computer
- Factoring and Discrete Logarithms
- Search Algorithms
- Design Methods for Quantum Algorithms
- Quantum Cryptography
- Quantum Complexity Theory
- Quantum Error Control Codes
- Fault-Tolerant Computing
Computer Use
Some materials will be available only on the web. Some
announcements will be made by e-mail.