About
I am a Quantum Postdoctoral Fellow at the Simons Institute for the Theory of Computing. Previously, I did my PhD at UT Austin, where I was fortunate to have Scott Aaronson as my PhD advisor. Before that, I was an undergrad in Mathematics with Computer Science at MIT.
My research lies broadly in quantum computational complexity theory. Much of my work focuses on (limitations of) quantum algorithms and (in)ability to apply classical algorithmic techniques in quantum computation. Some common topics of study in my research include query complexity, structural complexity, pseudorandom quantum states, learning theory, and the stabilizer formalism, especially as they apply to computational problems involving quantum states and unitary transformations.
Interested in learning more about my work? Check out this Quanta Magazine article about my (and others') research on quantum state complexity.
On the side, I have a large interest in combination puzzles, especially Rubik's-type "twisty puzzles". Some of my non-CS theory papers below grew out of this interest. I have also designed more than a dozen unique 3D-printed twisty puzzles, all of which have been shared on the Twisty Puzzles forum, and most of which can be found in the Twisty Puzzles museum. Many of my designs are also available for download.