On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability
From MaRDI portal
Publication:5189232
DOI10.1007/978-3-642-10698-9_10zbMATH Open1274.81048OpenAlexW2135799019MaRDI QIDQ5189232FDOQ5189232
Authors: Miguel Navascués, Masaki Owari, 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
Recommendations
- On the power of P systems with symport rules
- \(P\)-separation of \(P\)-sets and its applications
- On \(d\)-separability of powers and \(C_p(X)\)
- On strict \(T\)-power invariant implications: properties and intersections
- On the power of the semi-separated pair decomposition
- On the Power of the Semi-Separated Pair Decomposition
- The corestriction of p-symbols
- scientific article
- On the intersection and the extendibility of \(P_t\)-sets
- Partially symmetric functions are efficiently isomorphism testable
Cited In (8)
- Dimension-free entanglement detection in multipartite Werner states
- Quantum de Finetti theorems under local measurements with applications
- Limitations of semidefinite programs for separable states and entangled games
- Squashed entanglement, \(\mathbf {k}\)-extendibility, quantum Markov chains, and recovery maps
- 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
- Semidefinite programming hierarchies for constrained bilinear optimization
- An improved semidefinite programming hierarchy for testing entanglement
This page was built for publication: On the Power of the PPT Constraint in the Symmetric Extensions Test for Separability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189232)
