I am a PhD candidate in Computer Science at Stony Brook University, advised by Supartha Podder. My research interests include quantum computation and computational complexity theory. Specifically, I am currently focusing on quantum query lower-bounding techniques and the analysis of various quantum complexity classes. Before beginning my PhD, I completed my B.A. in Mathematics and Computer Science at UC Santa Cruz, my M.S. in Applied Mathematics at Stony Brook University and worked as a software engineer.

• New Lower-bounds for Quantum Computation with Non-Collapsing Measurements

  David Miloschewsky, Supartha Podder
  arXiv
  Computational Complexity Conference (CCC) 2025

• Complexity Garden

  An interactive website for complexity classes which me and others are building. Feel free to check it out and leave some feedback!

• Email: [first_name].[last_name]@gmail.com
• LinkedIn