|
|
| (2 szerkesztő 40 közbeeső változata nincs mutatva) |
| 1. sor: |
1. sor: |
| − | =Quantum Information Processing=
| + | http://physics.bme.hu/BMETE11MF42_kov?language=en |
| − | ==Course Information, 2019 Spring==
| + | |
| − | | + | |
| − | *'''Lecturers:''' András Pályi, Zoltán Zimborás
| + | |
| − | *'''Responsible lecturer:''' András Pályi
| + | |
| − | *'''Language:''' English
| + | |
| − | *'''Location:''' F3212
| + | |
| − | *'''Time:''' Wednesdays, 12:15-13:45
| + | |
| − | | + | |
| − | ==Details==
| + | |
| − | | + | |
| − | * One goal is to provide an introduction to basic concepts of quantum information theory and computing. Another goal is to provide hands-on experience in programming an actual quantum computer. That is, the basic concepts, gadgets, algorithms, etc., should be implemented and run by the students themselves during the course and as homework. We will use the quantum computers of the IBM Quantum Experience project, which are available via the cloud for anyone.
| + | |
| − | * Lectures will combine conventional, frontal presentation, and programming exercises. Therefore, the location is a computer lab. Of course, students are welcome to use there own laptop computers.
| + | |
| − | * The main resource used for the course is the online documentations of (1) the quantum computers available through the IBM Quantum Experience project [https://quantumexperience.ng.bluemix.net/qx/experience], and (2) the Qiskit quantum computing framework [https://qiskit.org/].
| + | |
| − | * Grades: There is an exam at the end of the semester. You'll get a few exercises that you have to solve on the spot on your own. Using online resources is allowed. The exercises will be similar to those on the exercise sheets published in the "Course material" table below. We suggest that you solve all exercises before the exam as a preparation.
| + | |
| − | | + | |
| − | ==Course material== | + | |
| − | | + | |
| − | {| class="wikitable"
| + | |
| − | |-
| + | |
| − | ! scope="col" style="width: 25px; height: 25px;" | #
| + | |
| − | ! scope="col" style="width: 300px;" | Lecture
| + | |
| − | ! scope="col" style="width: 200px;" | Exercises
| + | |
| − | ! scope="col" style="width: 200px;" | Solutions
| + | |
| − | ! scope="col" style="width: 200px;" | Homework Solutions
| + | |
| − | |-
| + | |
| − | ! style="height: 25px;" | 01
| + | |
| − | | [[Media:QIP2019Spring-Lecture01.pdf|Basics: quantum information, python, qiskit]]
| + | |
| − | | [[Media:ExercisesLecture01.pdf|ExercisesLecture01.pdf]]
| + | |
| − | | [[Media:SolutionsLecture01.pdf|SolutionsLecture01.pdf]]
| + | |
| − | | [[Media:SolutionsLecture01-QX.pdf|SolutionsLecture01-QX.pdf]]
| + | |
| − | |-
| + | |
| − | ! style="height: 25px;" | 02
| + | |
| − | | [[Media:QIP2019Spring_Lecture02.pdf|The Bernstein-Vazirani quantum algorithm]]
| + | |
| − | |
| + | |
| − | |
| + | |
| − | |
| + | |
| − | |-
| + | |
| − | ! style="height: 25px;" | 03
| + | |
| − | | [[Media:QIP2019Spring-Lecture03.pdf|Decoherence 1: the density matrix]]
| + | |
| − | | [[Media:ExercisesLecture03.pdf|ExercisesLecture03.pdf]]
| + | |
| − | | [[Media:SolutionsLecture03.pdf|SolutionsLecture03.pdf]]
| + | |
| − | |
| + | |
| − | |-
| + | |
| − | ! style="height: 25px;" | 04
| + | |
| − | | ...
| + | |
| − | | ...
| + | |
| − | | ...
| + | |
| − | | ...
| + | |
| − | |}
| + | |
| − | | + | |
| − | ==List of topics==
| + | |
| − | | + | |
| − | * Basics: quantum information, python, and qiskit (Lecture 1, AP)
| + | |
| − | * Bernstein-Vazirani algorithm (Lecture 2, ZZ)
| + | |
| − | * Density matrix. State tomography. Process Tomography. Relaxation. Dephasing. Decoherence. (Lectures 3-5, AP).
| + | |
| − | * Quantum algorithms: Deutsch, Grover, Shor, quantum simulation (Lectures 6-9, ZZ)
| + | |
| − | * Classical, hybrid, and quantum error correction using the repetition code. (Lectures 10-11, AP)
| + | |
| − | * Bell inequalities. Quantum teleportation. (Lecture 12, ZZ)
| + | |
