On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability

DOI10.1007/978-3-642-10698-9_10zbMath1274.81048OpenAlexW2135799019MaRDI QIDQ5189232

Masaki Owari, Miguel Navascués, Martin B. Plenio

Publication date: 9 March 2010

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10698-9_10

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (8)

Quantum de Finetti theorems under local measurements with applications ⋮ Semidefinite programming hierarchies for constrained bilinear optimization ⋮ Limitations of semidefinite programs for separable states and entangled games ⋮ Squashed entanglement, \(\mathbf {k}\)-extendibility, quantum Markov chains, and recovery maps ⋮ An improved semidefinite programming hierarchy for testing entanglement ⋮ Schur-Weyl duality for the Clifford group with applications: property testing, a robust Hudson theorem, and de Finetti representations ⋮ k-Extendibility of high-dimensional bipartite quantum states ⋮ Dimension-free entanglement detection in multipartite Werner states

This page was built for publication: On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability