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 Oct 15, 2026)

1. Introduction to Quantum Computing (Maher Mamah, Bruno Sterner - 23/09/2026)
   For the first week, we start with a motivation on quantum computing including the basic definitions and discussion on complexity classes. This will serve as a elementary foundation for the rest of the reading group.
   • - References: [10], [12] and [14].
     
2. Quantum Information Theory (Elnaz Hessami Pilehrood, Owen Waldron - 30/09/2026)
   Pure quantum states describe systems whose preparation is known exactly, but realistic quantum information often involves uncertainty, inaccessible subsystems, and interactions with the environment. In this talk, we introduce density operators as a general framework encompassing both pure and mixed states. We then discuss quantum channels, which model physical transformations and common forms of noise affecting quantum systems. Finally, we introduce classical and quantum entropy as measures of uncertainty and information, and explain how these ideas provide basic intuition for quantum cryptographic security.
   • - References: [10], [12] and [14].
     
3. Quantum Circuits (Mojtaba Fadavi, Taha Hedayat - 07/10/2026)
   Equipped with the knowledge of quantum information, we present how to use quantum states to build a quantum algorithm. While classical circuits represent how one makes algorithms using the bits 0 and 1, quantum circuits represent how one makes algorithms using qubits \(\ket{\alpha} = \alpha_0 \ket{0} + \alpha_1\ket{1}\). In this presentation, we will introduce the definition and presentation of quantum gates. Starting with 1-qubit gates and expanding to n-qubit gates. We also present the standard gates such as the Pauli Gates, CNOT, CCNOT, SWAP, etc. Then we proceed to see the effects and interactions of these gates along with some measurements.
   • - References: [10], [12] and [14].
     
4. Quantum Key Distribution (Masuda Fatima, Maggie Simmons - 21/10/2026)
   Quantum Key Distribution (QKD) uses the laws of Quantum Mechanics to allow two parties to produce a shared secret key only known to them without it's security relying on the computational hardness. In this presentation, we will introduce the QKD protocol BB84, and present how it is secure against various attacks. We will also discuss two major phases in BB84: the information reconciliation phase between keys of sender and receiver via error correcting codes and the privacy amplification phase where two communicating parties distill highly secret shared key from a larger body of a shared key, which is only partially secret. Finally, we will give a brief overview of Muckle-based hybrid authenticated key exchange (AKE) protocols.
   • - References: [2], [6], [4] and [11].
     
5. QKD Security and Post-Quantum Cryptography in QKD (Douglas Stebila - 28/10/2026)
   Having seen the BB84 quantum key distribution protocol last week, this week we’ll see what it means for QKD to be secure, following the basic principle that “information gain implies disturbance”. We’ll talk about what authentication is needed for QKD’s security guarantees to hold, and other factors like device security and finite key effects.
   • - 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].