量子计算 (Spring 2021): Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>TCSseminar
No edit summary
imported>TCSseminar
 
(31 intermediate revisions by the same user not shown)
Line 61: Line 61:
= Announcement =
= Announcement =
* (2021/3/8) 从第二周开始进行<font color=red >线下</font>授课。
* (2021/3/8) 从第二周开始进行<font color=red >线下</font>授课。
* (2021/3/24) 第一次作业已发布,4月7日上课前提交。


= Course info =
= Course info =
* '''Instructor ''': 姚鹏晖 ([mailto:pyao@nju.edu.cn pyao@nju.edu.cn])
* '''Instructor''': 姚鹏晖 ([mailto:pyao@nju.edu.cn pyao@nju.edu.cn])
* '''Teaching assistant''': 赵铭南 ([mailto:DZ20330042@smail.nju.edu.cn DZ20330042@smail.nju.edu.cn])
* '''Teaching assistant''': 赵铭南 ([mailto:DZ20330042@smail.nju.edu.cn DZ20330042@smail.nju.edu.cn])
* '''Class meeting''': 周三, 8:00-9:50, 仙 I-101.
* '''Class meeting''': 周三, 8:00-9:50, 仙 I-101.
Line 76: Line 77:


= Assignments =
= Assignments =
* 每章结束后有4~5道题目,在第二次上课前发送到助教(赵铭南)邮箱 DZ20330042@smail.nju.edu.cn。
* [[量子计算 (Spring 2021)/Assignment 1|Assignment 1]] due on 2021/4/7. [[量子计算 (Spring 2021)/Assignment 1 已提交名单|Assignment 1 已提交名单]]
 
* [[量子计算 (Spring 2021)/Assignment 2|Assignment 2]] due on 2021/5/8. [[量子计算 (Spring 2021)/Assignment 2 已提交名单|Assignment 2 已提交名单]]
* 每道题要有完整的解题过程,中英文不限。
* [[量子计算 (Spring 2021)/Assignment 3|Assignment 3]] due on 2021/6/9. [[量子计算 (Spring 2021)/Assignment 3 已提交名单|Assignment 3 已提交名单]]
* <font color=red >期末考核 due on 2021/6/30.</font> ([http://1.15.137.158/qc2021spring/final.docx 期末考核.docx])


= Lecture Notes =
= Lecture Notes =
如果有下载课件的问题请及时联系助教。
如果有下载课件的问题请及时联系助教。
* Lecture 1 ([http://1.15.137.158/qc2021spring/lec1.pptx slides])
* Lecture 1 ([http://1.15.137.158/qc2021spring/lec1.pptx slides])
* Lecture 2: Introduction and Overview ([http://1.15.137.158/qc2021spring/lec2.pptx slides])
* Lecture 2: Introduction and overview ([http://1.15.137.158/qc2021spring/lec2.pptx slides])
* Lecture 3 ([http://1.15.137.158/qc2021spring/lec3.pptx slides])
* Lecture 4 ([http://1.15.137.158/qc2021spring/lec4.pptx slides])
* Lecture 5: Quantum circuits ([http://1.15.137.158/qc2021spring/lec5.pptx slides])
* Lecture 6&7: BV Algorithms, Simon’s Algorithm & Fourier Transform ([http://1.15.137.158/qc2021spring/lec6.pptx slides])
* Lecture 8: Shor’s Factoring Algorithm and Hidden Subgroup Problem ([http://1.15.137.158/qc2021spring/lec8.pptx slides])
* Lecture 9: Grover’s search algorithm ([http://1.15.137.158/qc2021spring/lec9.pptx slides])
* Lecture 10: Quantum walk ([http://1.15.137.158/qc2021spring/lec10.pptx slides])
* Lecture 11: Lower bounds on quantum query complexity ([http://1.15.137.158/qc2021spring/lec11.pptx slides])
* Lecture 12: Quantum Communication Complexity ([http://1.15.137.158/qc2021spring/lec12.pptx slides])
* Lecture 13: Entanglement and Non-Locality ([http://1.15.137.158/qc2021spring/lec13.pptx slides])

Latest revision as of 12:06, 27 September 2021

量子计算
Quantum Computation
Instructor
姚鹏晖
Email pyao@nju.edu.cn
Office 计算机系 502
Class
Class meetings 周三, 8:00-9:50
仙 I-101
Office hours 周二, 14:00-16:00
计算机系 502
Textbooks
Ub17686c32db841e5851e7ed0062118ef0.jpg
Michael A. Nielsen / Isaac L. Chuang
Quantum Computation and Quantum Information.
Cambridge Univ Press, 2011.
Teaching Assistant
赵铭南
Email DZ20330042@smail.nju.edu.cn
Office 计算机系 410
v · d · e


Announcement

  • (2021/3/8) 从第二周开始进行线下授课。
  • (2021/3/24) 第一次作业已发布,4月7日上课前提交。

Course info

  • Instructor: 姚鹏晖 (pyao@nju.edu.cn)
  • Teaching assistant: 赵铭南 (DZ20330042@smail.nju.edu.cn)
  • Class meeting: 周三, 8:00-9:50, 仙 I-101.
  • Office hour: 周二, 14:00-16:00, 计算机系 502.
  • QQ group: 808749651(2021量子计算课程群) (加群时请注明学号和姓名)

Course materials

如果在获取教材方面有困难可以联系助教。(仅限英文版)

Assignments

Lecture Notes

如果有下载课件的问题请及时联系助教。

  • Lecture 1 (slides)
  • Lecture 2: Introduction and overview (slides)
  • Lecture 3 (slides)
  • Lecture 4 (slides)
  • Lecture 5: Quantum circuits (slides)
  • Lecture 6&7: BV Algorithms, Simon’s Algorithm & Fourier Transform (slides)
  • Lecture 8: Shor’s Factoring Algorithm and Hidden Subgroup Problem (slides)
  • Lecture 9: Grover’s search algorithm (slides)
  • Lecture 10: Quantum walk (slides)
  • Lecture 11: Lower bounds on quantum query complexity (slides)
  • Lecture 12: Quantum Communication Complexity (slides)
  • Lecture 13: Entanglement and Non-Locality (slides)