Ben Foxman
Graduate Student
Yale University
Graduate Student
Yale University
Hello! I am a second-year computer science Ph.D. student at Yale University, where I'm advised by Professor Yongshan Ding. I'm interested quantum computing and computational complexity. My goal is to understand how quantum algorithms can be leveraged to solve challenging computational problems, for both theoretical and near-term applications.
Prior to graduate school, I double majored in Mathematics and Computer Science, also at Yale.
Some general questions which interest me at the moment:
Efficient Quantum (Pseudo)randomness: Recently, there's been mounting evidence that quantum computers can generate random quantum bits much faster than classical computers can generate classical random bits. How far can we take this observation? Can we generate quantum randomness even on today's quantum computers (which cannot be run for very long due to noise)?
Quantum Circuit Complexity: In classical computer science, we have a rich understanding of "weak" models of computation, corresponding to various kinds of constant-depth circuits ("NC0, AC0, TC0...."). Unfortunately, we know much less about the analogous models in quantum computing. Can we develop new tools to help improve our understanding?
"Random Unitaries in Constant (Quantum) Time" (arXiv:2508.11487). Ben Foxman, Natalie Parham, Francisca Vasconcelos, Henry Yuen.
"Systems Architecture for Quantum Random Access Memory" (arXiv:2306.03242). Shifan Xu, Connor T Hann, Ben Foxman, Steven M Girvin, Yongshan Ding. MICRO 2023.
"Quantum Cognitive Modeling: New Applications and Systems Research Directions" (arxiv.org:2309.00597). Raghavendra Pradyumna Pothukuchi, Leon Lufkin, Yu Jun Shen, Alejandro Simon, Rome Thorstenson, Bernardo Eilert Trevisan, Michael Tu, Mudi Yang, Ben Foxman, Viswanatha Srinivas Pothukuchi, Gunnar Epping, Bryant J Jongkees, Thi Ha Kyaw, Jerome R Busemeyer, Jonathan D Cohen, Abhishek Bhattacharjee.