2000 character limit reached
Inequalities detecting entanglement for arbitrary bipartite systems
Published 13 Jun 2014 in quant-ph | (1406.3578v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.