Latest blog
Longest Increasing Subsequence, through a greedy lens.
Why patience sorting works: a simple journey from Pareto dominance and state pruning to an O(n log n) binary-search algorithm.
Ph.D. candidate in Physics, Boston College
I work with Prof. Xiao Chen on measurement-induced entanglement transitions, coherent-error phases, plaquette models, and the numerical methods needed to study them at scale.
Recent writing & research
Latest blog
Why patience sorting works: a simple journey from Pareto dominance and state pruning to an O(n log n) binary-search algorithm.
Latest research
Shows how U(1) conservation laws slow participation-entropy relaxation through diffusive charge correlations, producing hydrodynamic memory and finite-size crossover behavior.
I study problems where quantum dynamics, statistical mechanics, and computation meet: how entanglement changes under measurement, how coherent errors can organize into phases, and how plaquette-model constructions make monitored-circuit problems accessible to classical statistical mechanics.
My computational work is practical by necessity. I write and maintain simulation code in Python, C/C++20, MATLAB/C-MEX, and Julia, usually on Linux clusters with SLURM and Git-based workflows.
Understanding phase structure in monitored quantum circuits and coherent-error models.
Constructing classical plaquette models for monitored circuits and analyzing their symmetries, constraints, and cellular-automaton structure.
Building fast samplers, bit-packed linear algebra routines, and cluster-ready workflows for large sweeps.