Quantum computations (course of lectures)
arXiv:2107.08047
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.
arXiv comment145 pages, Latex, some figures added, some misprints corrected
References in corpus (10)
- Quantum Teleportation is a Universal Computational Primitive
- Strengths and Weaknesses of Quantum Computing
- Grover's quantum searching algorithm is optimal
- Efficient Simulation of Quantum Systems by Quantum Computers
- Simulations of Many-Body Quantum Systems by a Quantum Computer
- Physics without Determinism: Alternative Interpretations of Classical Physics
- KLM quantum computation with bosonic atoms
- Quantum Computers Speed Up Classical with Probability Zero
- Novel coherent quantum bit using spatial quantization levels in semiconductor quantum dot
- Lower Bounds of Quantum Search for Extreme Point