I am a Computer Science Ph.D. student at the University of Maryland, where I work on quantum computing.

Before that I did an undergraduate degree in Math and CS at the University of Toronto, where I was advised by Henry Yuen.

-  CV  -   -

## Research

I am broadly interested in the theory of quantum computing.

### On the complexity of zero gap MIP*

International Colloquium on Automata, Languages, and Programming ICALP, 2020
Theory of Quantum Computation TQC, 2020
arxiv - slides

We characterize the complexity of exactly computing the maximum winning probability of entangled non-local games and show it to be strictly harder than the halting problem. In particular, we show that the class of zero-gap entangled multiprover interactive proofs, $$MIP_0^*$$, is equal to $$\Pi_2$$, a class within the second level of arithmetical hierarchy from computability theory.