Research

Updated November 2026.

Recent Research Preprints

Enumerating Pauli Stabilizer Codes through Ten Qubits
Joint work with Greg Kuperberg. Preprint, 8 November 2026.
View PDF

Isometry Classes of Codes via Hall Polynomials
Joint work with Greg Kuperberg. Preprint, 10 November 2026.
View PDF

Current Research

My research is in quantum coding theory and computational mathematics. I also work on mathematical questions in optimization and machine learning.

At UC Davis, I have worked with my advisor Greg Kuperberg on the classification of Pauli stabilizer codes through ten qubits up to local Clifford operations and qubit permutations. We are planning to extend the full classification to eleven qubits in a C++ HPC cluster implementation. In a separate project, I use Burnside's lemma and module theory to count equivalence classes of classical linear codes and quantum CSS codes. Hall polynomial recurrences provide the fixed-subspace and fixed-flag counts needed for these computations.

With Suvrit Sra, I have worked on Riemannian bilevel optimization and the mathematical structure of Transformer models. Our projects have studied connections between memory in Transformers and first-order optimization methods. We have also investigated how AI agents can acquire useful context through active inference. I visited his group at TU Munich in summer 2024.

In summer 2023, I was a visiting graduate researcher in Anurag Anshu's group at Harvard University. I investigated connections between explicit sum-of-squares lower bounds and the NLTS theorem, aiming to discover a classical analog of NLTS.

Publications and Preprints