2 citations · 2 across the 1 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2024
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…
quant-ph2023
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…
quant-ph2020
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…