We prove that for any $\epsilon > 0$ it is NP-hard to
approximate the non-commutative Grothendieck problem to within a
factor $1/2 + \epsilon$, which matches the approximation ratio of
the algorithm of Naor, Regev, and Vidick (STOC'13). Our proof...
Read More
