LTAT.04.004
Quantum Seminar
The Quantum Seminar is for master's students who want to specialize in quantum crypto, quantum computing, or quantum communication.
Most topics require both graduate-level math and quantum information basics (LTAT.04.008 (Introduction to) Quantum Algorithms and/or MTAT.07.024 Quantum Crypto).
Organization
Setup
- Taking
LTAT.00.008 Theoretical Informatics Project
(3 ECTS) in parallel is encouraged (to implement stuff that's in your seminar paper; talk to your seminar supervisor!) - There's a class meeting in the beginning of the semester, and the talks are near the end of the semester.
Presentations
- Talks are 80 min + questions
- All course meetings are online-only.
- Meeting times will be doodled with the participants
Topic Areas
- Quantum Crypto (Prof. Unruh)
- Theory of Quantum Computation (Prof. Unruh)
- Quantum Algorithms (Assoc. Prof. Theis)
- Quantum Error Correction (Assoc. Prof. Theis)
- Quantum information processing & transmission with light & photons (Assoc. Prof. Theis)
- Miscellaneous quantum computing (Assoc. Prof. Theis)
Some specific topics
1. & 2. Quantum Crypto & Theory of Quantum Computation
Quantum Hoare Logic with Ghost Variables
- https://arxiv.org/pdf/1902.00325.pdf
- Supervisor: Prof. Unruh
Quantum and classical registers
- https://arxiv.org/pdf/2105.10914.pdf
- Supervisor: Prof. Unruh
Any other works related to formal verification or (foundations/semantics of) quantum programming or quantum crypto, on demand. Contact Prof. Dominique Unruh for more info.
3. Quantum Algorithms
Quantum coupon collector
- Reference: arXiv:2002.07688
- Abstract: Classical coupon collector can be formulated as follows: given each cereal box contains a coupon and there are altogether k different coupons what is the expected number of boxes you have to buy in order to collect all different coupons. More formally, given uniformly random samples from a subset S of [n] of size k, what is the expected number of samples needed to identify S with high probability. The classical algorithm proposes k*log(k) number samples. However given certain assumptions on n and k the amount of quantum samples required can be asymptotically reduced.
- Supervisor: Evgenii Dolzhkov
Adversary lower bound for the k-sum problem
- Reference: arXiv:1206.6528
- Abstract: The paper presents a proof for a tight query lower bound on the problem of deciding whether there exist k numbers among n that sum up to a prescribed number, provided that the alphabet size is sufficiently large. Mathematical techniques used there are rather interesting, however there are no advanced theories used, so the paper should be rather understandable.
- Supervisor: Evgenii Dolzhkov
4. Quantum Error Correction
A pedestrian view on quantum error correction
- It's possible to cover some aspects of Quantum Error Correction without the mathematical machinery developed in Basqect: No groups, no stabilizers, no density operators or quantum channels — only kets and quantum circuits.
- Reference: Chapter 5 in Mermin Quantum Computer Science. An Introduction. (2007)
- Overview: Simplified Example; 7-Qbit Error-Correcting Code; Operations On 7-Qbit Codewords; 7-Qbit Encoding Circuit.
- Supervisor: Javier Gil Vidal
- Student: Uku Kangur
CSS-Codes
- The Calderbank-Shor-Steane construction combines two classical codes over GF(2) to one quantum (stabilizer) code. The construction is sufficiently well explained in Nielsen-Chuang. Base the presentation on either Basqect or Mermin's chapter (see previous topic).
- Supervisor: Dirk Oliver Theis
- Student: Tejas Anil Shah
ZX-calculus for lattice surgery
- Advanced topic
- Requires thorough understanding of fault-tolerant quantum computing
- Supervisor: Dirk Oliver Theis
- Student: Alejandro Villoria
5. Quantum information processing & transmission with light & photons
Creating entangled photonic states with linear optics
- Advanced topic
- Requires some familiarity with quantum optics
- Supervisor: Dirk Oliver Theis
- Student: Anabel Ovide
6. Miscellaneous quantum computing
HPC-QC integration
- Supervisor: Dirk Oliver Theis
- Student: Handy Kurniawan
See ya!