50% homeworks (you can scribe to replace some homework), 50% final project
This is a graduate-level course but no prior knowledge of quantum mechanics or quantum computation is needed. In this course, we will together explore how quantum computers significantly change the landscape of modern cryptography but also how cryptography helps find and forward many important concepts in quantum computing. These include but are not limited to breaking the famous RSA cryptosystem, proof of quantumness, quantum money, position verification, pseudo-entanglement and pseudo-random states (and connections of AdS/CFT and the wormhole growth paradox), and many others.
A detailed schedule will be continuously updated each week. An outline of the tentative course materials is below:
introduction + single-qubit states, multi-qubit states, measurement, recap of linear algebra over C
quantum operations: quantum gates, general measurements and quantum algorithms
Quantum Fourier Transform (QFT) and fast integer factorization (Shor's algorithm)
Grover's algorithm and quantum collision finding (BHT algorithm)
BB84 quantum states, monogamy-of-entanglement: secret-key quantum money
subspace states: public-key quantum money and quantum copy-protection
trap-door claw-free functions (TCFs) and proof of quantumness
position verification from TCFs
pseudo-random quantum states and pseudo-entanglement
Scribing Template: [Overleaf Link]
3 or 4 assignments in total.
Solutions should be typeset in LaTeX.
[File] (will update soon)
CSE291 in prior year
Course by Dr. Zhandry
Course by Dr. Ananth
Course by Dr. Vidick
Course videos by Dr. O'Donnell
Book by Nielsen and Chuang: Quantum Computation and Quantum Information