Quantum computations (course of lectures)

TL;DR

This lecture course introduces quantum computing, covering its theoretical foundations, different models, and advantages over classical computing, aimed at students with basic linear algebra and analysis knowledge.

Contribution

It provides a comprehensive overview of quantum computing models and highlights problems where quantum methods outperform classical ones.

Findings

Quantum computing operates in quantum state space, not binary strings.

Various models like Feynman, fermionic, and adiabatic are discussed.

Quantum computing can solve certain problems more efficiently than classical methods.

Abstract

This course of lectures has been taught for several years at the Lomonosov Moscow State University; its modified version in 2021 is read in the Zhejiang University (Hangzhou), in the framework of summer school on quantum computing. The course is devoted to a new type of computations based on quantum mechanics. Quantum computations are fundamentally different from classical ones in that they occur in the space of so-called quantum states, and not in ordinary binary strings. Quantum computing is a real process in which the mathematical description is inextricably linked with quantum physics. Various forms of quantum computing are considered: the Feynman gate model, fermionic and adiabatic computations. A class of problems is described in which quantum computing is not only more efficient than classical ones, but also cannot be replaced by them. The course is designed for students of physics and mathematics and natural science specialties as well as all those interested in this subject. It requires familiarity with the basics of linear algebra and mathematical analysis in the first two courses of the university.