Organizers: Leonardo Colò, Bruno Sterner
When: Wednesday, 10:00a.m.
Where: MC5501
Goal: Build an understanding of quantum computing, quantum key distribution (QKD) and security proofs in the quantum random oracle model (QROM).
>> Notes (Last updated on Sept 29, 2026)

1. Introduction to Quantum Computing (Maher Mamah, Bruno Sterner - 23/09/2026)
   • - Qubits, measurement, and the difference between classical and quantum information.
     - Superposition, tensor products, and entanglement.
     - Examples of quantum computation.
     - References: [10], [12] and [14].
     
2. Quantum Information Theory (Elnaz Hessami Pilehrood, Owen Waldron - 30/09/2026)
   • - Quantum states, density operators, and mixed states.
     - Quantum channels and the effect of noise.
     - Entropy, information, and basic security intuition.
     - References: [10], [12] and [14].
     
3. Quantum Circuits (Mojtaba Fadavi, Taha Hedayat - 07/10/2026)
   • - Single-qubit gates and controlled operations.
     - Circuit notation, measurement, and common circuit identities.
     - Bell-state preparation as a worked example.
     - References: [10], [12] and [14].
     
4. Quantum Key Distribution (Maggie Simmons - 21/10/2026)
   • - BB84: preparation, transmission, measurement, and basis sifting.
     - Error estimation, reconciliation, and privacy amplification.
     - How QKD keys can enter a hybrid authenticated key exchange.
     - References: [2], [6], [4] and [11].
     
5. QKD Security and Post-Quantum Cryptography in QKD (Douglas Stebila - 28/10/2026)
   • - Secrecy and correctness definitions for QKD.
     - Finite-key effects and assumptions about devices and authentication.
     - Combining QKD with post-quantum components in hybrid protocols.
     - References: [11].
     
6. Challenges in Deploying QKD (Aodhan Corrigan - 4/11/2026)
   • - Invited talk.
     
7. The Random Oracle Model and Classical Security Proofs (Huanhuan Chen, Bruce Xu - 11/11/2026)
   • - Ideal hash functions and oracle access in the classical random-oracle model.
     - Security games, reductions, and game-hopping proofs.
     - Programming an oracle and tracking an adversary's queries.
     - References: [9].
     
8. Definitions for the Quantum Random Oracle Model (Jonas Janneck, Camryn Steckel - 18/11/2026)
   • - Quantum superposition queries to a random oracle.
     - How quantum access changes classical proof techniques.
     - Oracle unitaries and the basic QROM security setting.
     - References: [3].
     
9. QROM Lemmas (Speaker - 25/11/2026)
   • - Why measuring or reprogramming quantum queries needs new bounds.
     - The one-way-to-hiding lemma.
     - Compressed-oracle and measure-and-reprogram techniques.
     - References: [1], [7] and [8].
     
10. An Example Security Proof in the QROM (Seunghoon Lee - 2/12/2026)
    • - Fiat-Shamir signatures as a worked QROM proof.
      - Fujisaki-Okamoto transform analysis in QROM.
      - Where measure-and-reprogram enters the proof and what it costs.
      - References: [5] and [8].