2020/2021
Введение в квантовые вычисления
Статус:
Дисциплина общефакультетского пула
Кто читает:
Департамент электронной инженерии
Когда читается:
3 модуль
Преподаватели:
Ихсанов Ренат Шамильевич
Язык:
английский
Кредиты:
3
Контактные часы:
2
Course Syllabus
Abstract
"Quantum Computing" is among those terms that are widely discussed but often poorly understood. The reasons of this state of affairs may be numerous, but possibly the most significant among them is that it is a relatively new scientific area, and it's clear interpretations are not yet widely spread. The main obstacle here is the word "quantum", which refers to quantum mechanics - one of the most counter-intuitive ways to describe our world. But fear not! This is not a course on quantum mechanics. We will gently touch it in the beginning and then leave it apart, concentrating on the mathematical model of quantum computer, generously developed for us by physicists. This doesn't mean that the whole course is mathematics either (however there will be enough of it). We will build a simple working quantum computer with our bare hands, and we will consider some algorithms, designed for bigger quantum computers which are not yet developed. The course material is designed for those computer scientists, engineers and programmers who believe, that there's something else than just HLL programming, that will move our computing power further into infinity. Since the course is introductory, the only prerequisites are complex numbers and linear algebra. These two are required and they have to be enough.
Learning Objectives
- Introduction to the fast-growing field of quantum computing.
- Studying the structural units of quantum computers of the future, forming an understanding of the differences between quantum bits and classical bits.
- Study of basic quantum logical operations and algorithms for processing quantum information.
- Mastering basic knowledge about the practical use of quantum algorithms and quantum programming skills.
Expected Learning Outcomes
- Knowledge: Know Shor's algorithm.
- Skills: Be able to perform basic quantum computing operations.
- Possess: Master the skill of performing the quantum Fourier transform.
- Knowledge: Know the characteristics of classical and quantum computing systems.
- Skills: Be able to perform basic linear algebra operations.
- Possess: Have a basic knowledge of the practical use of quantum algorithms.
- Knowledge: Know methods for describing systems with many qubits.
- Possess: Have a basic knowledge of describing the evolution of quantum systems.
- Knowledge: Know the Deutsch problem statement.
- Knowledge: Know Grover's algorithm.
Course Contents
- Topic 1. Intro.Introduction to Introduction. Information and Computations. Characteristics of Computational Systems. Computability and Algorithms. Computational Complexity. Quantum Computing. The Multiverse Interpretation of Quantum Mechanics.
- Topic 2. Mathematical Model of Quantum Computing.Qubit. Qubit Measurement. Systems with Multiple Qubits. Measuring the Multiple Qubits Systems. Quantum System Evolution. Computations.
- Topic 3. Quantum Computer and Quantum Algorithms.Deutsch's Problem. Quantum Computer Prototype, DIY. Quantum Computer Prototype. Solving the Deutsch's Problem. More Algorithms.
- Topic 4. Shor's Algorithm.Intro. Factoring and the RSA. Factoring and Period Finding. Quantum Fourier Transform. Shor's Algorithm.
- Topic 5. Grover's Algorithm. A Quantum Computer Application Boundaries.Intro. Grover's Algorithm. Grover's Algorithm. A Closer Look. Can we do Better than Grover? Are Quantum Computers Always Better?
Assessment Elements
- Самостоятельная работа
- Экзамен (тест)If a student misses the exam because of some valid reason, s/he receives «absence» grade. The grade for the course is calculated on the course page on the basis of the student’s number of points that are awarded to the student for answering questions of the proposed tests. Контрольные работы и экзамен по курсу проводятся в письменной форме на платформе Coursera (https://www.coursera.org/learn/intro-to-numerical-analysis). Во время написания контрольных и экзаменационных работ студентам запрещено: общаться с кем-либо, пользоваться конспектами и подсказками. Кратковременным нарушением связи во время контрольной работы или экзамена считается нарушение связи менее часа. Долговременным нарушением связи считается нарушение связи в течение часа и более. При долговременном нарушении связи студент не может продолжить участие в контрольной или экзамене. Процедура пересдачи аналогична процедуре сдачи.
Bibliography
Recommended Core Bibliography
- Nielsen, M. A. (2005). Cluster-state quantum computation. https://doi.org/10.1016/S0034-4877(06)80014-5
- Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and Quantum Information (Vol. 10th anniversary ed). Cambridge: Cambridge eText. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=352482
Recommended Additional Bibliography
- Hassanien, A. E., Elhoseny, M., & Kacprzyk, J. (2018). Quantum Computing:An Environment for Intelligent Large Scale Real Application. Cham: Springer. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsebk&AN=1615992
- Sakkaris, P., & Sudhakaran, R. (2019). A Multilayer Network Approach to Quantum Computing. Retrieved from http://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsarx&AN=edsarx.1909.09863