Research
I am broadly interested in the theory of quantum computing.


On the complexity of zero gap MIP*
Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen
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 nonlocal games and show it to be strictly harder than the halting problem. In particular, we show that the class of zerogap entangled multiprover interactive proofs, \(MIP_0^*\), is equal to \(\Pi_2\), a class within the second level of arithmetical hierarchy from computability theory.


A generalization of CHSH and the algebraic structure of optimal strategies
David Cui, Arthur Mehta, Hamoon Mousavi, Seyed Sajjad Nezhadi
Quantum 4, 346, 2020
Quantum Information Processing QIP, 2020
arxiv
We introduce a family of games that generalize CHSH, viewing it as a linear constraint system game. These provide the first example of nonlocal games that selftest nonPauli operators and states other than the maximally entangled state. We also introduce the Glued Magic Square game that is not a selftest for any strategy. Our results suggest a richer landscape of selftesting phenomena than previously considered.

