TSIT11 · 6 credits · Advanced level (A1N) · Datateknik, Elektroteknik, Teknisk fysik
Quantum Algorithms and Quantum Information
Active · next start VT 2027
72%
passed the latest ordinary exam
TEN1 · 1 Jun 2026 · 18 students
73%
passed the ordinary exams, all sittings over the last 5 years
TEN1 · 63 students
Part of 6 programmes
- Master of Science in Applied Physics and Electrical Engineering - International
- Master of Science in Applied Physics and Electrical Engineering
- Master of Science in Computer Science and Engineering
- Master of Science in Information Technology
- Master of Science in Computer Science and Software Engineering
- Master's Programme in Mathematics
Exam
TEN1 Written examination
- 5
- 4
- 3
- U
- 1
Ordinary exams
73% passed · 63 students
- 72%18
- 91%11
- 56%9
- 89%9
- 63%16
Re-exams
No sittings with at least 5 students.
- Get 4 or 5: 49% (63 students)
Show small sittings (7)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%2
- 100%1
- 67%3
- 100%2
- 50%2
- 0%1
- 100%1
Other modules
Partial exams, hand-ins and labs. They are not part of the figures at the top.
Hand-in or lab
LAB1 Laboratory work
- G
- U
Main rounds
99% passed · 71 students
- 100%18
- 100%13
- 90%10
- 100%13
- 100%17
Later rounds
No sittings with at least 5 students.
Show small sittings (1)
Sittings with fewer than 5 students, often credit transfers or special sittings. They are not part of any figure on this page.
- 100%3
About the course
Aim
After completing the course, the student should be able to
- Describe the basic advantages and limitations of quantum computation and quantum computer algorithms
- Analyze quantum computer algorithms and evaluate systems for quantum calculations.
- Exemplify the use of quantum computer algorithms.
Content
- Bits, quantum bits, Boolean algebra, logical gates, quantum logical gates, discrete Fourier transform
- Quantum mechanical notions: superposition, the uncertainty principle, cloning, mixed states, state purification, idealized measurements, positive operator valued measures
- Gate oriented quantum algorithms: Deutsch-Jozsa, Simon's algoritm, phase estimation, Shor's factoring algorithm och Grover's search algorithm
- Adiabatic quantum algorithms: Ground state search, optimization, machine learning
- Noise models, channels, error correction
- Tests of quantum computer advantage: Boson sampling, shallow circuits, Classical and quantum Turing machines, the Oracle model, complexity measures
- Examiner
- Joakim Argillander
- Scheduled hours
- 32 h
- Main field of study
- Datateknik, Elektroteknik, Teknisk fysik