6.443/8.371/18.436 Quantum Information Science

Spring 2018

Lecture: MW9:30-11 (2-190)

Instructor: Aram W Harrow
Office hours: MW 11-12, 6-416a

TA: Saeed Mehraban
Office hours: Th 3-4, location 24-317

Videos and online problem sets can be found at the MITx site.

We are using Piazza for discussions.

Assignments

Lectures

Notes posted before lecture should be considered rough drafts which will be finalized after the lecture.
  1. Feb 7, 2018 (pdf, video): Introduction, density matrices, quantum operations.
    A review of density matrices can be found in these 8.06 lecture notes or the 8.370 lectures.
    Suggested reading: [NC], chapter 2; [KSV], chap 10

  2. Feb 12, 2018 (pdf, video, more video on norms): quantum operations formalism, measurement, norms
    Suggested reading: [NC], chapters 8 (except 8.4), 9.1-9.2; [KSV], chapters 11-12

  3. Feb 14, 2018 (pdf, video): introduction to codes. Classical and linear codes.
    Suggested reading: [NC], chapter 10.1-10.4 [KSV], chapters 15, notes on Chernoff bound

  4. Feb 20, 2018 (pdf): Quantum error-correction.
    Suggested reading: [NC], chapter 10.5

  5. Feb 21, 2018 (pdf, videos): Stabilizer states and codes.

  6. Feb 26, 2018 (pdf, pdf, videos): The symplectic picture of the Clifford group

  7. Mar 5, 2018 (videos): Intro to fault-tolerant quantum computing
    Suggested reading: [NC], chapter 10.6

  8. Mar 7, 2018 (videos): Universal fault-tolerant quantum computing

  9. Mar 12, 2018 (videos): Magic states and toric code
    Suggested reading: [KSV], chapter 15.9

  10. Mar 14, 2018 (videos): Measurement-based quantum computing
    Suggested reading: [Short version: R. Raussendorf and H.J. Briegel. A One-Way Quantum Computer. PRL 2001,
    Long version: R. Raussendorf, D.E. Browne and H.J. Briegel. Measurement-based quantum computation with cluster states. PRA 2003. ]

  11. Mar 19, 2018 (videos): Introduction to complexity theory
  12. Mar 21, 2018 (videos): Complexity, reductions and hardness
  13. Apr 2, 2018: Post-selection and quantum supremacy
  14. Apr 4, 2018: Quantum algorithms overview. Abelian QFT.
  15. Apr 9, 2018: Quantum algorithms for groups. Phase estimation and the HSP.
  16. Apr 11, 2018: HSP: discrete log and nonabelian HSP
  17. Apr 18, 2018: Dihedral HSP
  18. Apr 23, 2018: Polynomial speedups
  19. Apr 25, 2018: Classical information theory 1
  20. Apr 30, 2018: Classical information theory 2
  21. May 2, 2018: Classical and quantum information theory
  22. May 7, 2018: Student presentations
  23. May 9, 2018: Student presentations
  24. May 14, 2018: Student presentations
  25. May 16, 2018: Student presentations

References