📅 Date: Monday, March 23, 2026
🕚 Time: 11:00 – 12:00
Location: Heinzel Seminar Room, Office Building West
Speaker: Aaradhya Pandey (Princeton)
Title: Information, Computation, & Quantization: Infinitely divisible privacy and beyond
Abstract:
In this talk, I introduce a hypothesis-testing-based formulation of differential privacy in classical computation. The Gaussian Differential Privacy framework of Dong–Roth–Su (2022) established a central limit theorem for the composition of multiple private mechanisms. Building on this work, I present a Poisson extension of their result and show that both the Gaussian and Poisson limits are unified under a broader framework of infinitely divisible privacy. This perspective reveals structural connections between differential privacy, probability theory, statistics, and discrete mathematics. I conclude by discussing computational differential privacy and its connections to cryptographic constructions such as pseudorandom generators, as well as a step toward quantizing privacy in quantum computation, outlining a framework for both computational and quantum differential privacy.