Research

My research interests are in quantum computing, quantum error correction, coding theory, and cryptography. I study mixed-register stabilizer codes and concrete minimum-distance guarantees for fast-encoding codes used in cryptography.

My approach to these problems is interdisciplinary but problem-driven: I draw on neighboring areas when they sharpen a concrete coding-theoretic or cryptographic question. From this foundation, I am also interested in the interface between quantum computing and cryptography, complexity-theoretic questions about the capabilities and limits of quantum computation, and the design and analysis of quantum algorithms.

Current work

Quantum error correction · With Prof. Lane G. Gunderman

Mixed-register stabilizer codes

We develop a coding-theoretic framework for stabilizer codes on mixed-register quantum devices, whose quantum locations have non-uniform local dimensions. We characterize the algebraic structure governing mixed-register Pauli commutation and prove no-go theorems for coprime trans-dimensional Clifford entanglement, oscillator–qudit stabilizer codes, and stabilizer codes over pairwise coprime local dimensions.

We also give two constructions for mixed-register stabilizer codes. The first uses a structure theorem for non-Abelian Pauli subgroups to determine the minimum number and dimensions of additional registers needed to resolve noncommutativity. The second combines stabilizer codes over coprime local dimensions through shared registers, preserves the minimum constituent distance and stabilizer sparsity, and yields coding-theoretically optimal mixed-register qLDPC code families from known good qLDPC codes.

Manuscript under review at IEEE Transactions on Information Theory.

Preprint QEC26 poster

Coding theory and cryptography · With Prof. Alex R. Block

Concrete distance bounds for accumulate codes

We study the minimum-distance guarantees of fast-encoding codes used in cryptography. Our analysis covers repeat-accumulate (RA), repeat-accumulate-accumulate (RAA), and Bernoulli expand-accumulate (EA) codes over any fixed finite field with more than two elements, motivated by their use in succinct zero-knowledge proofs and pseudorandom correlation generators.

Our main contribution is a field-agnostic, modular framework for the minimum-distance analysis of encode-accumulate codes. Its distributional union bound separates the accumulator's input weight, partial-sum cancellations, and spacing of nonzero symbols. Combining this framework with binomial-moment and Chernoff bounds yields explicit, closed-form upper bounds on the probability that a sampled code falls below a target minimum distance.

The bounds support direct parameter evaluation at message lengths up to 2⁶⁰, without extrapolating from smaller instances. We also derive sufficient conditions for asymptotically vanishing failure probability.

Manuscript under review at Eurocrypt.

Earlier research

Systems security · With Prof. Xiaoguang Wang

Security-enhanced software runtime

My undergraduate research was in systems security. I developed a userspace runtime that served and evicted executable pages on demand, reducing the executable in-memory footprint by 40%, and trained an 80M-parameter autoregressive transformer on 1.7B execution tokens for anomalous control-flow detection. This work formed my Honors capstone and was presented at the UIC Undergraduate Research Forum.