K-INFO
HU
EN
Login

Quantum Computing and its Applications

Kvantuminformatikai alkalmazások
A tantárgyleírás hatályossága
Hatályosság kezdete:
2026. March 21.
Hatályosság vége:
Subject name (Hungarian, English)
Kvantuminformatikai alkalmazások
Quantum Computing and its Applications
Subject code BMEVIHIAD00
Subject type
Training Level
Course types and hours (weekly/semester)
Course type lecture tutorial laboratory
hours (weekly) 2 2 0
type (linked/independent) derived course
Assessment type félévközi érdemjegy
Credits 5
Subject coordinator
DR. Bacsárdi László
position: egyetemi docens
Responsible department
Hálózati Rendszerek és Szolgáltatások Tanszék
Faculty Villamosmérnöki és Informatikai Kar
Subject website
Primary curriculum type
Direct prerequisites – Strong prerequisite none
Direct prerequisites – Weak prerequisite none
Direct prerequisites – Parallel prerequisite none
Direct prerequisites – Milestone prerequisite none
Direct prerequisites – Exclusion none

Objectives

Programme
Detailed description of the lectures
1.    The motivation for quantum computing. The Moore's law and the relationship to quantum mechanics. Possible applications of quantum computing. A brief history of quantum mechanics.
2.    Postulates of quantum computing: quantum bit, operations, measurement, register
3.    Entanglement and its effects.  Bell states. EPR paradox.
4.    Measurement: the link between the quantum and the classical world. Measurement techniques: projective measurement.  Relationship between different measurements.
5.    General description of the quantum interferometer. Copying in the quantum world (No Cloning Theorem).
6.    Production of arbitrary quantum bits using basic quantum gates. Superdensity coding. Teleportation.
7.    Quantum key distribution. Operation and implementation of the BB84 protocol. Operation and implementation of the B92 protocol. Second generation QKD.
8.    Building blocks of quantum computing systems.
9.    Fundamentals of quantum parallelism. Description of the Deutsch-Jozsa algorithm. Basics of quantum Fourier transform.
10.    Phase estimation. Overview of the Shor algorithm.
11.    Efficient search in disordered databases: the Grover algorithm.
12.    Principles of quantum computing: overview of different physical implementations
13.    Quantum Internet implementation issues. Reliable and unreliable nodes. Quantum signal repeaters.
14.    Technological challenges of free-space quantum key distribution. Space quantum communications: quantum communications on satellite systems.

Detailed topics of the exercises/lab
1.    Operations with quantum bits and quantum registers
2.    Operations on the Bloch sphere
3.    Design of quantum information circuits
4.    Quantum random number generation
5.    Programming quantum computers 1: getting to know IBM's quantum computer
6.    Programming quantum computers 2: algorithm implementation using a circuit diagram
7.    Quantum computer programming 3: algorithm implementation in a programming language
8.    Quantum computer programming 4: writing simple quantum algorithms
9.    Programming quantum computers 5: implementing quantum protocols
10.    Programming quantum computers 6: limitations of running algorithms
11.    Quantum key distribution in practice 1: technological implementation of fiber-based quantum key distribution
12.    Quantum-based key distribution in practice 2: technological implementation of free-space quantum-based key distribution
13.    Shor algorithm operation through a practical example
14.    Quantum mechanical worldviews (observer, parallel universes) and their practical implications





The aim of the course is to provide students with knowledge of quantum computing. With the tools of quantum computing, many applications can be created that produce solutions much faster than traditional computer algorithms. Examples of such applications are cracking the public key cryptography, fast search in unsorted databases. In addition, quantum computing offers communication protocols that are unconventional in the classical world (e.g. superdense coding, teleportation). The aim of the course is to explain the basics of quantum circuits and several quantum computing algorithms, and to highlight the importance of quantum computing and the diversity of its applications.

Learning outcomes

Ez a tantárgy a KKK rendeletben meghatározott, következő kompetenciák fejlesztését szolgálja:

Knowledge

No learning outcomes recorded.

Skills

No learning outcomes recorded.

Attitudes

No learning outcomes recorded.

Autonomy and responsibility

No learning outcomes recorded.

Oktatási módszertan

Lecture. Successful completion of the subject and the interdependence of knowledge require to continuous follow the content of the lectures. Practice: review of lecture material, supplemented by practical examples.

Tanulástámogató anyagok

Online források
S. Imre, F. Balázs: Quantum Computing and Communications – An Engineering Approach, Published by John Wiley and Sons Ltd, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ, England, 2005, ISBN 0-470-86902-X; Additional Hungarian and English language resources are available in electronic form.

Recommended preliminary knowledge for completing the subject

Knowledge type competencies
(azon előzetes ismeretek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Skill type competencies
(azon előzetes képességek és készségek összessége, amelyek megléte nem kötelező, de a tantárgy eredményes teljesítését nagyban elősegíti)
nincs
Recommended (non-compulsory) preliminary competencies
(azon ajánlott (nem kötelező) előzetesen megszerzendő kompetenciák összessége, amelyek jelentősen hozzájárulnak a tantárgy eredményes teljesítéséhez)
nincs
General rules
Requirements: During the semester, students write 3 small mid-term exams and one homework assignment. For each of the three small mid-term exams, a minimum of 40% must be AND a minimum of 40% of the homework score must be achieved. The final grade for the subject is 3x20% of the mid term exams and 40% of the homework score. Additional possibilities: Students will be given the opportunity to retake any small mid-term during the retake week (all three small exams can be retaken). Late submission of homework is possible up to the fourth day of the retake week for a special fee.
Assessment methods
In-term assessments

No detailed assessments provided.

Weight of in-term assessments

No weights provided.

Exam-period assessments

No detailed assessments provided.

Weight of exam elements

No weights provided.

Grade calculation

No grade thresholds provided.

Attendance requirements

No attendance requirements provided.

Rules for retake and resubmission

Not provided.

Short description

Not provided.

Detailed description
IMSc program: We provide extra work for IMSc points in the small mid-term exams. Extra assignments will be provided for IMSc points in the homework. IMSc points: In the small mid-term exams, 6 IMSc points are awarded per exam. The condition of the assessment of the IMSc assignment is the excellent mark in the mid-term exams. 7 IMSc points are available for homework. The condition of the assessment of the IMSc assignment is the excellent mark of the homework.
Recommended courses

Not provided.

Workload to complete the subject

No workload breakdown provided.

Validity of subject requirements
Requirements valid from:
Requirements valid until:
Curriculum placement

No curriculum placements recorded for this subject version.