Introduction to quantum computating
Quantum technologies have become a hot topic, with exciting advancements in quantum entanglement, quantum communication, and quantum computing. In this course, we will explore the fundamental theory behind these concepts, providing beginners with a structured and comprehensive introduction to quantum computation.
We begin by establishing the mathematical foundations of quantum mechanics, covering quantum states, quantum evolution, quantum measurement, and composite quantum systems. Building on this, we will examine key protocols such as quantum teleportation, superdense coding, and the Bell inequality.
Next, we introduce quantum circuits—the fundamental building blocks of quantum computers—and present several well-known quantum algorithms, including Deutsch-Jozsa, quantum Fourier transform, phase estimation, Shor’s factoring algorithm, HHL for solving linear equations, Grover’s search, and quantum walk-based algorithms.
Finally, we will explore some of the latest research directions in quantum computing and discuss open questions in the field. By the end of this course, students will have a solid theoretical foundation and a clearer perspective on the rapidly evolving landscape of quantum computation.
We begin by establishing the mathematical foundations of quantum mechanics, covering quantum states, quantum evolution, quantum measurement, and composite quantum systems. Building on this, we will examine key protocols such as quantum teleportation, superdense coding, and the Bell inequality.
Next, we introduce quantum circuits—the fundamental building blocks of quantum computers—and present several well-known quantum algorithms, including Deutsch-Jozsa, quantum Fourier transform, phase estimation, Shor’s factoring algorithm, HHL for solving linear equations, Grover’s search, and quantum walk-based algorithms.
Finally, we will explore some of the latest research directions in quantum computing and discuss open questions in the field. By the end of this course, students will have a solid theoretical foundation and a clearer perspective on the rapidly evolving landscape of quantum computation.
讲师
日期
2025年03月24日 至 06月18日
位置
Weekday | Time | Venue | Online | ID | Password |
---|---|---|---|---|---|
周一,周三 | 14:20 - 16:05 | A3-2-301 | ZOOM 13 | 637 734 0280 | BIMSA |
修课要求
Advanced Algebra, Complex Analysis, Quantum Mechanics
参考资料
1: Nielsen and Chuang. "Quantum Computation and Quantum Information."
2: John Watrous. "The Theory of Quantum Information." Online link: https://cs.uwaterloo.ca/~watrous/TQI/TQI.pdf
3: Scott Aaronson. "Introduction to Quantum Information Science Lecture Notes." Online link: https://www.scottaaronson.com/qclec.pdf
4: Lecture notes by Preskill available on his homepage. Online link: http://theory.caltech.edu/~preskill/ph219/ph219_2021-22.html
2: John Watrous. "The Theory of Quantum Information." Online link: https://cs.uwaterloo.ca/~watrous/TQI/TQI.pdf
3: Scott Aaronson. "Introduction to Quantum Information Science Lecture Notes." Online link: https://www.scottaaronson.com/qclec.pdf
4: Lecture notes by Preskill available on his homepage. Online link: http://theory.caltech.edu/~preskill/ph219/ph219_2021-22.html
听众
Advanced Undergraduate
, Graduate
视频公开
不公开
笔记公开
不公开
语言
中文
讲师介绍
王宇2019年于中国科学院数学与系统科学研究院博士毕业,取得计算机软件与理论学位,毕业后曾于深圳鹏城实验室工作,2020年12月加入雁栖湖应用数学研究院,研究方向为量子信息和量子计算,目前的主要研究领域为量子游走和量子态层析,具体而言,通过量子游走相关理论模型设计新型量子信息处理协议;通过优化测量资源和计算资源以高效读取未知量子态的信息或者预测其性质。