Sidhant Saraogi

PhD Student, Georgetown University

pfp.jpg

I am a Ph.D. student in Theoretical Computer Science at Georgetown advised by Justin Thaler and Alexander Golovnev. I am graduating in May 2026 and looking for postdoctoral and industry research positions . Please reach out if you are interested in my research. I am interested in exploring the limits of efficient circuits, error correcting codes and data structures. Recently, I have been thinking about:

  • lower bounds on locally decodable codes.
  • algorithms and lower bounds for the online Orthogonal Vectors problem.
  • circuit lower bounds against various models of low-depth circuits.
  • algorithms and lower bounds for the AVOID problems which relate to finding explicit constructions for circuit lower bounds, rigid matrices, etc.

I am especially interested in using developments from combinatorics to explore these questions.

Previously, I have been interested in privacy regulation, especially the GDPR. I encourage checking out the excellent Bridging Privacy working group.

I also contributed to (and help setup) the quantum information package of the popular quantum simulation toolbox QuTiP. You can read about my implementation of quantum circuit simulation here.