arXiv:2107.08047

Quantum computations (course of lectures)

Yuri Ozhigov

Published Jul 16, 2021• 1 citation

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.

DOI: 10.48550/arxiv.2107.08047

Related papers

Lectures on Quantum Mechanics for Mathematics Students

L. D. Faddeev, O. Yakubovskiĭ

This book is based on notes from the course developed and taught for more than 30 years at the Department of Mathematics of Leningrad University. The goal of the course was to present the basics of quantum mechanics and its mathematical content to students in mathematics. This book differs from the majority of other textbooks on the subject in that much more attention is paid to general principles of quantum mechanics. In particular, the authors describe in detail the relation between classical and quantum mechanics. When selecting particular topics, the authors emphasize those that are related to interesting mathematical theories. In particular, the book contains a discussion of problems related to group representation theory and to scattering theory. This book is rather elementary and concise, and it does not require prerequisites beyond the standard undergraduate mathematical curriculum. It is aimed at giving a mathematically oriented student the opportunity to grasp the main points of quantum theory in a mathematical framework.

Student mathematical libraryMar 9, 200954 citations

Brief Introduction to Quantum Computing for Undergraduate Students: Lecture Three — Quantum Gates, Quantum Circuits, and Simple Quantum Algorithms

Li Chen

This lecture continues Lectures One and Two, where we introduced the basic concepts of quantum computing and reviewed the essential linear algebra background for undergraduate students. In this lecture, we focus on the basic computational units of quantum computation, known as quantum gates. Quantum gates play a central role in quantum algorithms, as each quantum algorithm can be implemented as a sequence of quantum gate operations. This idea has a close analogy with classical computing, where computations can be represented by Boolean circuits constructed from elementary logic gates. In principle, classical algorithms can be implemented through combinations of such logic gates. To establish this connection, we first review several fundamental logic gates in classical computing, including the AND, OR, and NOT gates. These elementary Boolean gates provide a useful foundation for understanding quantum gates and how classical computational concepts are extended into the quantum domain. In general, a quantum processing unit (QPU), which executes quantum gate operations, can be viewed as the quantum counterpart of a classical central processing unit (CPU), where computations are carried out through logical operations and circuits. This lecture establishes the foundation for understanding the quantum circuit model and for designing and analyzing quantum algorithms in subsequent lectures. To provide a smooth transition to the topics that follow, we also introduce several tiny quantum algorithms and examples in this lecture. These examples illustrate how quantum gates can be combined to perform meaningful computational tasks and prepare students for the more advanced quantum algorithms discussed later.

ACM SIGACT NewsSep 22, 20260 citations

Lectures on the Mathematics of Quantum Mechanics I

Gianfausto Dell’Antonio

The first volume (General Theory) differs from most textbooks as it emphasizes the mathematical structure and mathematical rigor, while being adapted to the teaching the first semester of an advanced course in Quantum Mechanics (the content of the book are the lectures of courses actually delivered.). It differs also from the very few texts in Quantum Mechanics that give emphasis to the mathematical aspects because this book, being written as Lecture Notes, has the structure of lectures delivered in a course, namely introduction of the problem, outline of the relevant points, mathematical tools needed, theorems, proofs. This makes this book particularly useful for self-study and for instructors in the preparation of a second course in Quantum Mechanics (after a first basic course). With some minor additions it can be used also as a basis of a first course in Quantum Mechanics for students in mathematics curricula. The second part (Selected Topics) are lecture notes of a more advanced course aimed at giving the basic notions necessary to do research in several areas of mathematical physics connected with quantum mechanics, from solid state to singular interactions, many body theory, semi-classical analysis, quantum statistical mechanics. The structure of this book is suitable for a second-semester course, in which the lectures are meant to provide, in addition to theorems and proofs, an overview of a more specific subject and hints to the direction of research. In this respect and for the width of subjects this second volume differs from other monographs on Quantum Mechanics. The second volume can be useful for students who want to have a basic preparation for doing research and for instructors who may want to use it as a basis for the presentation of selected topics.

Atlantis studies in mathematical physicsJan 1, 201510 citations

Quantum Physics

Alfonso Barbas Espa

Course overviewThis course is aimed to introduce basic concepts and ideas on Quantum Mechanics.The lectures will focus on essential physical principles supported by mathematical developments when required.Every idea will be also illustrated with some technological application.The students will participate actively in the discussions and the course is aimed to combine work outside the class (pre-lectures and homework) as well as active discussions and peer instruction during class time.

Jul 24, 20260 citations

Quantum Physics

Alfonso Barbas Espa, Antonio Fernández Cardador, Ramón Rodríguez Pecharromán

Jan 11, 20250 citations

Quantum computation for solving linear systems

Yudong Cao

Quantum computation is a subject born out of the combination between physics and computer science. It studies how the laws of quantum mechanics can be exploited to perform computations much more efficiently than current computers (termed classical computers as oppose to quantum computers). The thesis starts by introducing ideas from quantum physics and theoretical computer science and based on these ideas, introducing the basic concepts in quantum computing. These introductory discussions are intended for non-specialists to obtain the essential knowledge needed for understanding the new results presented in the subsequent chapters. After introducing the basics of quantum computing, we focus on the recently proposed quantum algorithm for linear systems. The new results include i) special instances of quantum circuits that can be implemented using current experimental resources; ii) detailed quantum algorithms that are suitable for a broader class of linear systems. We show that for some particular problems the quantum algorithm is able to achieve exponential speedup over their classical counterparts.

Jan 1, 20130 citations