This is a two semester course on quantum computation and quantum information. It is open to all Phd and MS students from departments of physics, mathematics, computer science and electrical engineering. Only in rare cases undergraduate students can enroll in this course. At the end of the course, the student is supposed to be able to follow the the existing literature on the subject and prepare him or herself for doing original research. Those who are from departments other than physics, can self-study the first three lecture notes which introdcues them to the basics of quantum mechanics needed for this course.

These lecture notes are not complete and are being developed as I teach the course from time to time.

- An introduction to Quantum Computation and Computation
- Mathematical prerequisites for quantum mechanics (not taught in the class)
- Basics of quantum mechanics (not taught in the class)
- Density matrices
- Simple quantum information processing
- Simple Quantum Algorithms
- Reversible Classcial Computation
- Quantum Circuits
- Quantum Search Algorithm
- Factoring Algorithm
- Theory of Computation
- Completely Positive Maps
- Quantum error correcting codes - part I
- Quantum error correcting codes - part II
- Generalized measurements
- Classical Information Theory-Part I
- Classical Information Theory-Part II
- Non-locality in Quantum Mechanics
- Measures of Distance and Fidelity
- Quantum Information Theory-Part I
- Quantum Information Theory-Part II
- Topological Quantum Computation
- Appendix: Introduction to group theory
- Appendix: Introduction to number theory
- Appendix: Hidden subgroup problem

The class holds on each Sunday and Tuesday from 6:00 till 8:00 pm. The lectures start on Sunday 26th of Bahman 1399. This is the link of the class. It is advised that you use Google Chrome. The TA is Vahid Jannessary (PhD student) (vahid.jannesary@gmail.com) and his recitations are hold here on Wednesdays from 4:00 pm till 6:00 pm.

Time table of homework sets:

Set no. | Delivery date | Date due |
---|---|---|

Problem set 1 | 10 Esfand 1399 | 30 Esfand 1399 |

Problem set 2 | 30 Esfand 1399 | 15 Farvardin 1400 |

Problem set 3 | 15 Farvardin 1400 | 30 Farvardin 1400 |

Problem set 4 | 30 Farvardin 1400 | 15 Ordibehesht 1400 |

Problem set 5 | 15 Ordibehesht 1400 | 30 Ordibehesht 1400 |

Problem set 6 | 30 Ordibehesht 1400 | 23 Khordad 1400 |

7 | 15 Khordad 1400 | 30 Khordad 1400 |

8 | 30 Khordad 1400 | 15 Tir 1400 |

In the beginning of the course, you are supposed to choose your teammate (2 or 3 students). Members of each team are supposed to collaborate with each other on each of the problems, type the solutions with Latex and deliver them in pdf format. The grade of each homework set is equaly given to the members of each group, but the grades of the members of each group is differentiated on the basis of the MidTerm and Final exams which are taken as take home written exams. But in some cases I may require the student to give an oral exam. Your final grade is determined as shown in the following table:

Score from 20 | Date | |
---|---|---|

Homeworks | 14 | -- |

Midterm exam | 3 | 25 Far. 1400 |

Final Exam | 3 | 10 Tir 1400 |

Class Activity (extra point) | 2 | -- |

Term paper | 1 | 10 Tir 1400 |

By class activity I mean active participations in class discussions, i.e. asking good questions and giving correct answers. The term paper is optional and its grade depends on its quality. So you have 23 points in total, 3 of which is bonus points.