• Home
  • Search
  • Limitations of Semidefinite Programs for Separable States and Entangled Games
  • Open Access IconOpen Access
  • Cite Icon18
  • https://doi.org/10.1007/s00220-019-03382-yCopy DOI Icon

Limitations of Semidefinite Programs for Separable States and Entangled Games

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. 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 $\omega(1)$-round integrality gaps were known: the set of separable (i.e. unentangled) states, or equivalently, the $2 \rightarrow 4$ norm of a matrix, and the set of quantum correlations; i.e. conditional probability distributions achievable with local measurements on a shared entangled state. 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, 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.

Similar Papers
  • Research Article
  • Citations2

Quantum correlations in a family of bipartite separable qubit states

  • Feb 02, 2017
  • Quantum Information Processing
  • Chuanmei Xie +3
  • Research Article
  • Citations57

A Tight Lower Bound on the Classical Communication Cost of Entanglement Dilution

  • Feb 01, 2004
  • IEEE Transactions on Information Theory
  • A.W Harrow +1
  • Book Chapter
  • Citations57

Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack

  • Jan 01, 2011
  • Anna R Karlin +2
  • Research Article

The Dynamical Evolution of Quantum Correlations in the Two Isolate Spin Particles Coupled to a Common Bath

  • Oct 06, 2016
  • International Journal of Theoretical Physics
  • Xiang-Dong Zhai +3
  • Research Article
  • Citations49

Restricted numerical range: A versatile tool in the theory of quantum information

  • Oct 01, 2010
  • Journal of Mathematical Physics
  • Piotr Gawron +4
  • Conference Article
  • Citations11

Definability of semidefinite programming and lasserre lower bounds for CSPs

  • Jun 01, 2017
  • Anuj Dawar +1
  • Research Article
  • Citations1

Strengths and Limitations of Linear Programming Relaxations

  • Jan 01, 2017
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  • Abbas Bazzi
  • Research Article
  • Citations7

Tightness of correlation inequalities with no quantum violation

  • Jan 27, 2017
  • Physical Review A
  • Ravishankar Ramanathan +4
  • Research Article
  • Citations13

On the role of entanglement in two-photon metrology

  • Apr 19, 2017
  • Quantum Science and Technology
  • André Stefanov
  • Research Article
  • Citations8

Quantum correlation swapping in parallel and antiparallel two-qubit mixed states

  • Feb 27, 2019
  • Quantum Information Processing
  • Chuanmei Xie +3
  • Research Article
  • Citations14

Sums of squares based approximation algorithms for MAX-SAT

  • Oct 26, 2007
  • Discrete Applied Mathematics
  • H Van Maaren +2
  • Research Article

SIGEST

  • Jan 01, 2007
  • SIAM Review
  • The Editors
  • Conference Article

Discrimination of discord in separable Gaussian states

  • Sep 18, 2018
  • Gaetana Spedalieri +2
  • Research Article
  • Citations26

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

  • Jun 16, 2018
  • ACM Transactions on Algorithms
  • Samuel B Hopkins +4
  • Research Article
  • Citations5

Quantum correlations from classically correlated states

  • Mar 13, 2014
  • Physica A: Statistical Mechanics and its Applications
  • G Bellomo +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.