642:587:01 SELECTED TOPICS IN DISCRETE MATH SPRING, 2001
Quantum Computation
The quantum computation model was introduced and studied over the last decade as a variant on classical computation based on quantum mechanical principles. Many models in classical computation and communication theory have quantum analogs: Turing machines, circuits, interactive proofs, communication protocols, error-correcting codes and information theory. This course will provide a detailed survey of problems and results in this area.
The mathematical focus of this course is on the computation models. The underlying physics in detail will be discussed at a high level, but will not be covered in detail.
TIME AND PLACE: Monday, Wednesday 1:10-2:30 in HILL 425.
INSTRUCTOR: Michael Saks, HILL-430, saks@math.rutgers.edu, 445-5434
TEXT: Quantum Computation and Quantum Information, Michael A. Nielsen and Isaac L. Chuang.
PREREQUISITES: The formal mathematical prerequisites are rather minimal: basic linear algebra, group theory and probability. Combinatorics (642:582) will also provide useful background. No prior knowledge of quantum mechanics is necessary. Some experience with classical computation models and information theory will be very helpful, since we will be generalizing these models to the quantum setting. We will do some review of the classical models, but students without much experience with them may have to do some extra background reading.