I am a sixth year graduate student in the Theory of Computation group at MIT advised by Scott Aaronson who is now at UT Austin. My research interests include both quantum computation and classical complexity theory, and more generally the connections between physics and the limits of computation.

I am supported by an NSF Fellowship.

I recieved a B.S. in Computer Science and Mathematics at the University of South Carolina where I worked with Stephen Fenner on combinatorial game theory.

I am supported by an NSF Fellowship.

I recieved a B.S. in Computer Science and Mathematics at the University of South Carolina where I worked with Stephen Fenner on combinatorial game theory.

## Publications

A Quantum Query Complexity Trichotomy for Regular Languages With Scott Aaronson and Luke Schaeffer. QIP 2019. [arXiv] |

New Hardness Results for the Permanent Using Linear Optics With Luke Schaeffer. CCC 2018. [arXiv, slides] |

The Classification of Stabilizer Operations over Qubits With Luke Schaeffer. QIP 2018. [arXiv] |

The Classification of Reversible Bit Operations With Scott Aaronscon and Luke Schaeffer. ITCS 2017. [arXiv, slides] |

On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems With Itai Arad, Adam Bouland, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang. MFCS 2016. [arXiv] |

Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games With Stephen A. Fenner, Jochen Messner, Luke Schaeffer, and Thomas Thierauf. ISAAC 2015. [ECCC, slides] |

Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-complete. ICALP 2013. [arXiv, slides] |

On the Cyclic Van der Waerden Numbers. Geombinatorics 2012. [pdf] |