太阳成集团tyc411将于2022年6月27日至8月10日开展量子算法和编程国际暑期线上课程。该课程由“2022年国家自然科学基金天元数学专题讲习班暨浙江大学研究生国际暑期学校”项目支持，本年度面向太阳成集团tyc411在校本科生开放名额。

课程内容包括量子算法与编程的基本理论、量子算法的复杂性理论和局部哈密顿量及复杂性、绝热量子算法等，共66个学时。课程免学费并提供必要学习资料，顺利完成后可申请国际化模块（+3）学分，可认定第四课堂（+2）学分。

一、申请流程

请于2022年6月22日下午5点前登录教学管理信息服务平台（http://zdbk.zju.edu.cn/）完成项目报名。

项目对象：太阳成集团tyc411在校本科生（2019级本科生优先）

项目名额：100人

项目名称：（数学学院）量子算法和编程国际暑期线上课程

项目号：20211351

备注：报名后，学籍不在数学学院的同学请联系所在院（系）学园外事和团委负责老师完成“所在院（系）学园审核”环节。

申请、审核和认定手续请参考：

本科生对外交流管理系统2.0——学生版用户操作手册.pdf

报名联系人：陶老师 87953794  chenpingtao@zju.edu.cn

二、授课方式

线上授课。项目的后续安排将通过钉钉或邮件通知报名的同学，请及时关注钉钉和邮件信息。

三、课程安排

1. Professor Maksim

Lecture time: June 27, 29, July 1，3，5，7，9，26，28，30.

（Beijing time: 18.30-20.30）

Lecture 1 (June 27, Monday): Basics of Gate-based quantum computing

Materials: Lecture Notes: Programming Quantum Computers

Lecture 2 (June 29, Wednesday): Gate-based quantum computing – more details

Materials: Lecture Notes: Programming Quantum Computers

Lecture 3 (July 1, Friday): Basics of Quantum annealing

Materials: Lecture Notes: Programming Quantum Computers

Lecture 4 (July 3, Sunday): Quantum annealing – more details

Materials: Lecture Notes: Programming Quantum Computers

Lecture 5 (July 5, Tuesday): Program specifications in language Z

Materials: Formal Quantum Software Engineering

Lecture 6 (July 7, Thursday): Formalizing quantum software

Materials: Formal Quantum Software Engineering

Lecture 7 (July 9, Saturday): Insight into practical aspect of working in quantum programming

Materials: Evolution of Quantum Computing: A Systematic Survey on the Use of Quantum Computing Tools

Lecture 8 (July 26, Tuesday): Programming tasks that are solved today

Materials: Software Engineering for Quantum Programming: How Far Are We?

Lecture 9 (July 28, Thursday): Testing and quantum programming

Materials: A Comprehensive Study of Bug Fixes in Quantum Programs

Lecture 10 (July 30, Saturday): 1-qubit operations–programming and a Bloch sphere

Materials: https://gitlab.com/qworld/silver

2. Professor M.N. Vyalyi

Lecture time: July 11，12，14，15，17，19，20，21，23，24

（Beijing time: 18.30-20.30）

Lecture 1. Basic complexity classes

Introduction to complexity theory: languages and promise problems, resources, complexity measures, complexity classes (P, NP, coNP, PP, BPP).

Lecture 2. Quantum computation: main definitions

Quantum circuits, bases, approximate realizations of unitary operators, the class BQP and its relations with classical complexity classes.

Lecture 3. BQP-complete problems I

Reductions and complete problems. Examples of BQP-complete problems: evaluation of a qubit measurement, evaluation of a matrix element.

Lecture 4. BQP-complete problems II

Finite complete bases and Kitaev-Solovay theorem. Shi's theorems.

Lecture 5. Basic quantum subroutines and their applications

Grover search. Fourier samping. Phase estimation.

Lecture 6. Famous quantum algorithms.

Hidden subgroup problem. Integer factoring. Applications of Grover search.

Lecture 7. Quantum adiabatic computation and quantum approximate optimization algorithm.

Lecture 8. Relativization

Oracle computations. P and NP in relativized worlds.

Weakness of quantum computation in a relativized world.

Lecture 9. Strength of quantum computation in a relativized world

The class BPPpath and its relations with basic classes.

Forrelated distributions. Construction of separating oracles.

Lecture 10. Classical and quantum interactive proofs

The classes PSPACE, IP, QIP, MIP, MIP*. Relations between them.

3. Professor Wu Junde

Lecture time: August 2，4，6，8，10

（Beijing time: 18.30-20.30）

Lecture 1. Introduction to the Local Hamiltonian Problems

Lecture 2. Kitaev Construction

Lecture 3. The 2-local Construction

Lecture 4. 2-local Universal adiabatic computation (I)

Lecture 5. 2-local Universal adiabatic computation (II)

课程联系人：武老师wjd@zju.edu.cn