
Instructor  Dominique Unruh <<surname> at ut dot ee> 
Teaching assistent 
Prastudy Fauzi (but practice is given by Dominique) 
Lecture  Tuesdays 10:1511:45, room 612 (lectures may sometimes be switched with tutorial) 
Practice  Wednesday 10:1511:45, room 512 
Course Material  Lecture
notes, blackboard photos, practice blackboard photos (zip; huge zip), and exam study guide. 
Language  English 
Exam  TBA 
Contact  Dominique Unruh <<surname> at ut dot ee> 
20120904 (lecture)  Introduction and motivation. (Slides pptx, pdf) 
20120905 (practice)  Polarization filters in sequence, circular polarization. 
20120911 (lecture)  Mathematics of single qubits. ElizurVaidman bomb tester. 
20120912 (practice)  Enhanced ElizurVaidman bomb tester 
20120918 (lecture)  Multiqubit systems. Unitary operations on multiqubit systems. 
20120919 (practice)  Quantum teleportation. 
20120925 (lecture)  Measurements on multiqubit systems. 
20120926 (practice)  Implementing classical functions in quantum circuits. 
20121002 (lecture)  Deutsch's algorithm. Analysis of toy crypto protocol (started). Density operators (started) 
20121003 (practice)  Density operators: how to extend the system, how to do measurements. Nonequal density operators imply distinguishability. 
20121009 (lecture)  Toy crypto protocol (finished). Partial trace. 
20121010 (lecture)  Superoperators. Statistical distance. Trace distance. 
20121016 (practice)  Modelling an adversary's possible actions by using only unitaries. 
20121017 (practice)  Defining and proving the security of a toy crypto protocol. 
20121023 (lecture)  Security definition of quantum key distribution. 
20121024 (practice)  Security definition (secrecy) of a message transfer protocol. 
20121030 (lecture)  Proof of quantum key distribution (started). 
20121031 (lecture)  Proof of quantum key distribution (continued). 
20121106 (practice)  Security proof corresponding for the protocol from practice 20121024 
20121107 (practice)  Realizing the Bell test 
20121113 (lecture)  Proof of quantum key distribution (finished). Sketch: entanglement purification. 
20121114 (practice)  Computing the probability of guessing a key (in QKD without entanglement purification). 
20121120 (lecture)  Impossibility of unconditionally secure quantum commitments. 
20121121 (practice)  Impossibility of oblivious transfer (OT). 
20121127 (lecture)  Commitments in bounded quantum storage model (BQSM). Minentropy (uncertainty relation, chain rule). 
20121128 (lect.+pract.)  Lecture: Security proof in BQSM finished. Minentropy splitting. Practice: OT in BQSM 
20121204 (lecture)  Quantum time vaults. 
20121205 (practice)  Quantum time vault security: some proof steps 
20121211 (lecture)  Shor's algorithm: order finding, factoring, discrete logarithm 
20121212 (practice)  Discrete fourier transform: unitarity, frequency analysis 
20121218 (lecture)  Quantum money 
Out / due 
Homework 
Solution 

Sep 11 / Sep 18, noon 
Homework 1 
Solution 1 
Sep 19 / Sep 25, noon  Homework 2 
Solution 2 
Sep 25 / Oct 2, noon  Homework 3 
Solution 3 
Oct 2 / Oct 9, noon 
Homework 4 
Solution 4 
Oct 13 / Oct 23, noon 
Homework 5 
Solution 5 
Oct 23 / Oct 30, noon 
Homework 6 
Solution 6 
Oct 31 / Nov 13, noon 
Homework 7 
Solution 7 
Nov 20 / Nov 27, noon 
Homework 8 
Solution 8 
Nov 27 / Dec 9, noon 
Homework 9 
Solution 9 
Dec 6 / Dec 13, noon 
Homework 10 
Solution 10 
In quantum cryptography we use quantum
mechanical effects to construct secure protocols. The paradoxical
nature of quantum mechanics allows for constructions that solve
problems known to be impossible without quantum mechanics. This lecture
gives an introduction into this fascinating area.
Possible topics include:
You need no prior knowledge of quantum mechanics. You should have heard some introductory lecture on cryptography. You should enjoy math and have a sound understanding of linear algebra.
[NC00] Nielsen, Chuang. "Quantum Computation and Quantum Information" Cambridge University Press, 2000. A standard textbook on quantum information and quantum computing. Also contains some quantum cryptography.
Further
reading may be suggested during the
course. See the "further reading" paragraphs in the lecture notes.