Limitations of Semidefinite Programs for Separable States and Entangled Games
Name
Harrow_Limitations of Semidefinite Programs for Separable States and Entangled Games.pdf
Description
Accepted version
Size
526.11 KB
Format
Adobe PDF
Checksum (MD5)
1bd8934662125d559e45ab0606037ef6
Author(s)
Harrow, Aram W.
Natarajan, Anand
Wu, Xiaodi
Date Issued
March 2019
Journal
Communications in Mathematical Physics
Publisher
Springer Nature
Citation
Harrow, Aram W. et al., "Limitations of Semidefinite Programs for Separable States and Entangled Games." Communications in Mathematical Physics 366, 2 (March 2019): 423–68 doi. 10.1007/s00220-019-03382-y ©2019 Authors
Version
Author's final manuscript
Abstract
Semidefinite programs (SDPs) are a framework for exact or approximate optimization with widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs, meaning instances where the SDP value is far from the true optimum. These are based on new limitations on the sum-of-squares (SoS) hierarchy in approximating two particularly important sets in quantum information theory, where previously no ω(1) -round integrality gaps were known: 1.The set of separable (i.e. unentangled) states, or equivalently, the 2 → 4 norm of a matrix.2.The set of quantum correlations; i.e. conditional probability distributions achievable with local measurements on a shared entangled state.Integrality gaps for the 2 → 4 norm had previously been sought due to its connection to Small-Set Expansion (SSE) and Unique Games (UG). In both cases no-go theorems were previously known based on computational assumptions such as the Exponential Time Hypothesis (ETH) which asserts that 3-SAT requires exponential time to solve. Our unconditional results achieve the same parameters as all of these previous results (for separable states) or as some of the previous results (for quantum correlations). In some cases we can make use of the framework of Lee–Raghavendra–Steurer (LRS) to establish integrality gaps for any SDP extended formulation, not only the SoS hierarchy. Our hardness result on separable states also yields a dimension lower bound of approximate disentanglers, answering a question of Watrous and Aaronson et al. These results can be viewed as limitations on the monogamy principle, the PPT test, the ability of Tsirelson-type bounds to restrict quantum correlations, as well as the SDP hierarchies of Doherty–Parrilo–Spedalieri, Navascues–Pironio–Acin, and Berta–Fawzi–Scholz. Indeed a wide range of past work in quantum information can be described as using an SDP on one of the above two problems and our results put broad limits on these lines of argument. ©2019, Springer-Verlag GmbH Germany, part of Springer Nature.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00220-019-03382-y
