Inequalities detecting entanglement for arbitrary bipartite systems
classification
🪐 quant-ph
keywords
entanglementinequalitiesbipartitedetectingotimessystemsarbitrarycondition
read the original abstract
Based on the generators of $SU(n)$ we present inequalities for detecting quantum entanglement for $2 \otimes d$ and $M \otimes N$ systems. These inequalities provide a sufficient condition of entanglement for bipartite mixed states and give rise to an experimental way of entanglement detection.
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.