2.111 Quantum Computation
Department of Mechanical Engineering
Massachusetts Institute of Technology
Fall 2001
Description  Provides an introduction to the theory and practice of quantum computation. Topics covered: physics of information processing; quantum logic; quantum algorithms including Shor's factoring algorithm and Grover's search algorithm; quantum error correction; quantum communication and cryptography. Prior knowledge of quantum mechanics helpful but not required.
Information  Instructors:
Prof. Seth Lloyd Rm 3-160 252-1803 slloyd@mit.edu
Prof. Edward H. Farhi Rm 6-302A 253-4871 farhi@mitlns.mit.edu
Secretary: 
Suzanne Williamson Rm 3-164 253-3979 smwillia@mit.edu
TA:
Daniel Preda pylot@mit.edu

Hours: TR, 2:30-4:00, rm 3-370

Office hours: Prof. Lloyd: TBA; Daniel Preda: Thursday after lecture
 
Textbooks 
  • M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000. 
  • J. Preskill, notes on quantum computation

    •     http://www.theory.caltech.edu/people/preskill/ph229
  • A Peres, Quantum Theory: Concepts and Methods, Kluwer, Boston, 1995. 

    •     On reserve in Science library.
    Handouts 
    1. Course information [ postscript ] 
    2. Topics to be covered [ postscript ]
    3. Problem set 1 [ pdf ]; Solutions [ ps ]
    4. Some of Einstein's "letters" [ pdf ]
    5. Problem set 2 [ pdf] due 10/11; Solutions [ ps ]
    6. Problem set 3 [ pdf ]; Sketch of solutions [ ps ]
    7. Problem set 4 [ ps ];Sketch of solutions [ ps ]
    Quizzes 
    1. Quiz1 SOLUTIONS  1 / 2 / 3 / 4 / 5 / 6 / 7 
    Old quizes 
    1. Quiz #1 [ gif ]- SOLUTIONS  1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 
    2. Quiz #2 [ gif ]- SOLUTIONS  1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 
    Old Lecture notes 
     
     

     

    		          #  Lecture 1
             #  Lecture 2 1 / 2 / 3 / 4 / 5 / 6 / 7
             #  Lecture 3 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12
             #  Lecture 4 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12 / 13
             #  Lecture 5 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11
             #  Lecture 6 1 / 2 / 3 / 4 / 5 / 6 / 6a / 7 / 8 / 9 / 10 / 11 / 12 / 12a
             #  Lecture 7 1 / 2 / 3 / 4 / 5 / 6 / 7
             #  Lecture 8 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12 / 13 / 14 / 15
             #  Lecture 9 1 / 2 / 3 / 4 / 4a / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12 / 13
             #  Lecture 10 1 / 2 / 3 / 4 / 5 / 6
             #  Lecture 11 1 / 2 / 2a / 2b / 3 / 4 / 5 / 6 / 7 /  8
             #  Lecture 12 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12 / 13 / 14 / 15
             #  Lecture 13 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10
             #  Lecture 14 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 / 11 / 12
             #  Lecture 15 3 / 4 / 5 / 6 / 7 / 8 
             #  Lecture 16 1 / 2 /  3 / 4 / 5 / 6 / 7 / 8 / 9 / 10 
    Updated by Daniel Preda, 20 October 2001
    © Massachusetts Institute of Technology 2001