Entanglement conditions and polynomial identities
classification
🪐 quant-ph
keywords
conditionsentanglementapproachidentitiespolynomialwellappliedcharacterization
read the original abstract
We develop a rather general approach to entanglement characterization based on convexity properties and polynomial identities. This approach is applied to obtain simple and efficient entanglement conditions which work equally well in both discrete as well as continuous-variable environments. Examples of violations of our conditions are presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.