15 citations · 36 across the 7 of their papers we have counts for
14 papers
A Quantum Unique Games Conjecture
Hamoon Mousavi, Taro Spirig
After the NP-hardness of computational problems such as 3SAT and MaxCut was established, a natural next step was to explore whether these problems remain hard to approximate. While…
Approximation algorithms for noncommutative CSPs
Eric Culf, Hamoon Mousavi, Taro Spirig
Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their app…
Nonlocal Games, Compression Theorems, and the Arithmetical Hierarchy
Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen
We investigate the connection between the complexity of nonlocal games and the arithmetical hierarchy, a classification of languages according to the complexity of arithmetical for…
Synchronous Values of Games
J. William Helton, Hamoon Mousavi, Seyed Sajjad Nezhadi +2
We study synchronous values of games, especially synchronous games. It is known that a synchronous game has a perfect strategy if and only if it has a perfect synchronous strategy.…
On the complexity of zero gap MIP*
Hamoon Mousavi, Seyed Sajjad Nezhadi, Henry Yuen
The class is the set of languages decidable by multiprover interactive proofs with quantum entangled provers. It was recently shown by Ji, Natarajan, Vidick, Wrigh…
A generalization of CHSH and the algebraic structure of optimal strategies
David Cui, Arthur Mehta, Hamoon Mousavi +1
Self-testing has been a rich area of study in quantum information theory. It allows an experimenter to interact classically with a black box quantum system and to test that a speci…