An improved semidefinite programming hierarchy for testing entanglement

DOI10.1007/S00220-017-2859-0zbMath1364.81041arXiv1506.08834OpenAlexW3105588021MaRDI QIDQ529619

Aram W. Harrow, Anand Natarajan, Xiaodi Wu

Publication date: 19 May 2017

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08834

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items (6)

Bounding the separable rank via polynomial optimization ⋮ Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph ⋮ Unnamed Item ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Epsilon-net method for optimizations over separable states ⋮ Dimension-free entanglement detection in multipartite Werner states

Uses Software

• YALMIP
• Mosek

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faithful squashed entanglement
• Geometric algorithms and combinatorial optimization.
• First and second order analysis of nonlinear semidefinite programs
• Which problems have strongly exponential complexity?
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
• An exact Jacobian SDP relaxation for polynomial optimization
• Relative entropy and squashed entanglement
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Quantum interactive proofs with weak error bounds
• Epsilon-Net Method for Optimizations over Separable States
• Degree bounds for Gröbner bases of low-dimensional polynomial ideals
• Near-Optimal and Explicit Bell Inequality Violations
• Classical deterministic complexity of Edmonds' Problem and quantum entanglement
• On the combinatorial and algebraic complexity of quantifier elimination
• Sum-of-squares proofs and the quest toward optimal algorithms
• On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
• Pre- and Post-Processing Sum-of-Squares Programs in Practice
• Undecidability of the Spectral Gap
• On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability
• Algebraic Degree of Polynomial Optimization
• Approximating the set of separable states using the positive partial transpose test
• Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization
• Hypercontractivity, sum-of-squares proofs, and their applications
• Quantum de finetti theorems under local measurements with applications
• Strong duality in lasserre's hierarchy for polynomial optimization

This page was built for publication: An improved semidefinite programming hierarchy for testing entanglement