Quantum computation is a branch of quantum computer science that studies the quantum computational model, or, in other words, the computational capabilities of the so far hypothetical quantum computer. In the classical computational model, a computing device is in a certain state at any given time. The quantum model differs by the fact that the device can be in a superposition of an arbitrary number of classical states, which provides parallelism of calculations. The most famous result of quantum computation theory is the Shor's algorithm, which efficiently (in polynomial time) solves the problem of integer factorization. The course is devoted to the fundamentals of quantum computation theory. The basic quantum computational operations ("gates") and quantum algorithms (quantum teleportation protocol, the Deutsch, Bernstein-Vazirani, Simon, Shor algorithms, the Grover algorithm and its generalizations) will be considered. Also the foundations of quantum error-correcting codes and fault-tolerant quantum computation will be given.

Spring Semester Schedule of 2021/2022:

Time: Monday 10:00 – 11:25

First lecture: 7 February

Lecturer
Trushechkin Anton Sergeevich

Institutions
Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
Steklov Mathematical Institute of Russian Academy of Sciences, Moscow
Steklov International Mathematical Center