I am a Master’s student in Physics with Quantum Dynamics at Imperial College London. My research sits at the intersection of theoretical computer science and quantum engineering—from algorithm design and circuit synthesis to simulation, benchmarking, and the software that connects theory to hardware.

This past summer I was a visiting researcher at the Institute for Quantum Computing, working with Michele Mosca and Vlad Gheorghiu on quantum circuit synthesis and T-gate lower bounds, supported by an Undergraduate Research Award and the MITACS GlobalLink Research Internship. I also work part-time at BlueQubit on simulator benchmarking and quantum hackathon programs.

Previously I earned a B.S. in Computer Science from Carnegie Mellon University (Machine Learning and Algorithms & Complexity), conducted research at Caltech IQIM (SURF), and founded CMU Quantum. For a full record of positions and education, see my CV.

  • Sep 2026: Starting the MSc at Imperial College London.
  • Aug 2026: Matrix-processing paper posted to arXiv.
  • May–Aug 2026: Visiting researcher at IQC (Waterloo URA).
  • May 2026: B.S. in Computer Science, Carnegie Mellon.
  • Oct 2025: Part-time hire at BlueQubit.
  • Jun–Aug 2025: SURF at Caltech IQIM.
  • Sep 2024: Founded CMU Quantum.
  • Sep 13–18, 2026 · IEEE QCE, Toronto — two papers: hybrid quantum–classical sampling for discrete MRFs (QECS track) and depth-efficient quantum TDA for financial stress (QAPP track).
  • Sep 19–20, 2026 · IWQC, Toronto — International Workshop on Quantum Compilation.
  • Sep 21, 2026 · QRE, Toronto — poster on T-count lower bounds for diagonal third-level gates.
  • 2026 · TQC — poster, resource-efficient quantum matrix processing with commutator scaling. Poster
  • Aug 2025 · Caltech IQIM — SURF final presentation, early fault-tolerant algorithms for matrix functions via Trotter extrapolation. Report · Poster · Slides
  • Resource-Efficient Quantum Matrix Processing with Commutator Scaling (with J. Watson, S. Wang) TQC 2026 poster — low-depth matrix-function algorithms via product formulae. arXiv:2608.13862
  • T-Count Lower Bounds for Diagonal Third-Level Gates via Amy–Mosca Moments (single-author) — sharp Clifford+T synthesis lower bounds from cubic moment tensors; tight on parallel Toffoli layers. Draft
  • How Much Workspace Does Optimal-T Synthesis Need? (J. Lee and A. R. Mazumder, alphabetical) — ancilla complexity and T-count tradeoffs in the mixed Clifford+T model. Draft

Full publication list → · Projects →