Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2107.08047

Quantum computations (course of lectures)

Yuri Ozhigov

Published Jul 16, 2021• 1 citation
arXivHTMLPDF

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 library•Mar 9, 2009•56 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 physics•Jan 1, 2015•12 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 News•Sep 22, 2026•0 citations

Quantum Computing: Lecture Notes

Ronald de Wolf

This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 4 chapters about complexity, 4 chapters about distributed ("Alice and Bob") settings, a chapter about quantum machine learning, one about stabilizer states and Clifford circuits, and a final chapter about quantum error correction. Appendices A and B give a brief introduction to the required linear algebra and some other mathematical and computer science background. All chapters come with exercises, with some hints provided in Appendix C.

arXiv:1907.09415•Jul 19, 2019•198 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, 2026•0 citations

Quantum Physics

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

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.

•Jan 11, 2025•0 citations
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.
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.
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.
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.
This is a set of lecture notes suitable for a Master's course on quantum computation and information from the perspective of theoretical computer science. The first version was written in 2011, with many extensions and improvements in subsequent years. The first 10 chapters cover the circuit model and the main quantum algorithms (Deutsch-Jozsa, Simon, Shor, Hidden Subgroup Problem, Grover, quantum walks, Hamiltonian simulation and HHL). They are followed by 4 chapters about complexity, 4 chapters about distributed ("Alice and Bob") settings, a chapter about quantum machine learning, one about stabilizer states and Clifford circuits, and a final chapter about quantum error correction. Appendices A and B give a brief introduction to the required linear algebra and some other mathematical and computer science background. All chapters come with exercises, with some hints provided in Appendix C.