A gap for PPT entanglement
arXiv:1609.07079 · doi:10.1016/j.laa.2017.04.013
Abstract
Let be a finite dimensional vector space over a field with characteristic not equal to 2. Denote by and the subspaces of symmetric and skew-symmetric tensors of a subspace of , respectively. In this paper we show that if is generated by tensors with tensor rank 1, and is the smallest vector space such that then . This result has a straightforward application to the separability problem in Quantum Information Theory: If is separable then where is the flip operator, is the identity and is the marginal rank of . We prove the sharpness of this inequality. Moreover, we show that if is positive under partial transposition (PPT) and then is separable. This result follows from Perron-Frobenius theory. We also present a large family of PPT matrices satisfying . There is a possibility that an entangled PPT matrix satisfying exists. However, the family referenced above shows that finding one shall not be trivial.
References in corpus (9)
- Separability Criterion for Density Matrices
- Separability of Mixed States: Necessary and Sufficient Conditions
- Separability criterion and inseparable mixed states with positive partial transposition
- Unextendible Product Bases and Bound Entanglement
- Further results on the cross norm criterion for separability
- Four-qubit entangled symmetric states with positive partial transpositions
- Entangled symmetric states of N qubits with all positive partial transpositions
- Separability criteria and entanglement witnesses for symmetric quantum states
- Completely Reducible maps in Quantum Information Theory