Introduction to quantum computation

Prerequisite

Linear algebra; Complex analysis; Quantum mechanics; Algorithm

Abstract

We often hear about hot topics in quantum, such as quantum entanglement, quantum communication, and quantum computers. In this course, we will discuss the theory behind these concepts in detail. The goal is to help beginners gain a systematic understanding of the field of quantum computation. We will start with the mathematical basis of quantum mechanics to learn about quantum states, quantum evolution, quantum measurement, and quantum composite systems. We will then discuss quantum teleportation, superdense coding, and Bell inequality. Later, we introduce quantum circuits, the elementary unit for quantum computers, and present some famous quantum algorithms, such as Deutsch-Jozsa, Fourier transformation, phase estimation, Shor's fatoring algorithm, HHL for solving linear equations, Grover's search, and quantum walk-based algorithms. At last, we will also discuss some frontier research areas in quantum computation and leave some questions.

Lecturer Intro.

Yu Wang received his PhD degree in computer software and theory from the Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences in 2019. After graduation, he worked at Pengcheng Laboratory in Shenzhen. In December 2020, he joined the Yanqi Lake Beijing Institute of Mathematical Science and Applications. The main research area is about quantum information and quantum computation. Specifically, the current research is focuses on quantum state tomography, in order to optimize the measurement and computation resouce to read out the unknown quantum states. Besides, it is also studied to design new quantum communication protocols by different quantum walk models.