I will give the basics of quantum computing and quantum information 
theory, with special attention to geometric aspects.

Prerequisite: A solid class in linear algebra such as 323. Some 
familiarity with, multi-linear algebra,  discrete probability and 
undergraduate algebra will be useful, but is not required.

Text will be a revised version of
http://www.math.tamu.edu/~jml/quantumnotes.pdf

Outline:
Classical and probabilistic computing
Quantum mechanics for quantum computing
Quantum algorithms (Grover, Simons, Shor)
Classical information theory
Quantum information theory
Representation theory in quantum information theory

Grading: students will be asked to hand in 3 problems each week.