Log in with Facebook to participate in the Q&A.
Basics of computational complexity; basics of quantum information; quantum phenomena; quantum circuits and universality; relationship between quantum and classical complexity classes; simple quantum algorithms; quantum Fourier transform; Shor factoring algorithm; Grover search algorithm; physical realization of quantum computation; error-correction and fault-tolerance; quantum key distribution.
This course was so trivial. You could take it in first year and still get a 100. They say you should know quantum mechanics and theoretical CS but honestly I just remembered that F=ma and I was pretty much fine.
Added by Anonymous on 2011-09-30 18:41:08