Tight Hardness of the Non-commutative Grothendieck Problem

Jop Briot, Oded Regev, Rishi Saket

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We prove that it is NP-hard to approximate the non-commutative Grothendieck problem to within any constant factor larger than one-half, which matches the approximation ratio of the algorithm of Naor, Regev, and Vidick (STOC'13). Our proof uses an embedding of finite-dimensional Hilbert spaces into the space of matrices endowed with the trace norm with the property that the image of standard basis vectors is longer than that of unit vectors with no large coordinates.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015
PublisherIEEE Computer Society
Pages1108-1122
Number of pages15
Volume2015-December
ISBN (Print)9781467381918
DOIs
StatePublished - Dec 11 2015
Event56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015 - Berkeley, United States
Duration: Oct 17 2015Oct 20 2015

Other

Other56th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2015
CountryUnited States
CityBerkeley
Period10/17/1510/20/15

    Fingerprint

Keywords

  • Grothendieck inequality
  • hardness
  • semidefinite programming

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Briot, J., Regev, O., & Saket, R. (2015). Tight Hardness of the Non-commutative Grothendieck Problem. In Proceedings - 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015 (Vol. 2015-December, pp. 1108-1122). [7354446] IEEE Computer Society. https://doi.org/10.1109/FOCS.2015.72