A gap for PPT entanglement

Abstract: Let

W

be a finite dimensional vector space over a field with characteristic not equal to 2. Denote by

e x t S y m (V)

and

e x t S k e w - S y m (V)

the subspaces of symmetric and skew-symmetric tensors of a subspace

V

of

W o t i m e s W

, respectively. In this paper we show that if

V

is generated by tensors with tensor rank 1,

V = e x t S y m (V) o p l u s e x t S k e w - S y m (V)

and

W

is the smallest vector space such that

V s u b s e t W o t i m e s W

then

d i m (e x t S y m (V)) g e q m a x f r a c 2 d i m (e x t S k e w - S y m (V)) d i m (W), f r a c d i m (W) 2

. This result has a straightforward application to the separability problem in Quantum Information Theory: If

h o i n M_{k} o t i m e s M_{k} s i m e q M_{k^{2}}

is separable then

e x t r a n k (I d + F) h o (I d + F) g e q e x t m a x f r a c 2 r e x t r a n k (I d - F) h o (I d - F), f r a c r 2,

where

F i n M_{k} o t i m e s M_{k}

is the flip operator,

I d i n M_{k} o t i m e s M_{k}

is the identity and

r

is the marginal rank of

h o + F h o F

. We prove the sharpness of this inequality. Moreover, we show that if

h o i n M_{k} o t i m e s M_{k}

is positive under partial transposition (PPT) and

e x t r a n k (I d + F) h o (I d + F) = 1

then

h o

is separable. This result follows from Perron-Frobenius theory. We also present a large family of PPT matrices satisfying

e x t r a n k (I d + F) h o (I d + F) g e q r g e q f r a c 2 r - 1 e x t r a n k (I d - F) h o (I d - F)

. There is a possibility that an entangled PPT matrix

h o i n M_{k} o t i m e s M_{k}

satisfying

1 < e x t r a n k (I d + F) h o (I d + F) < f r a c 2 r e x t r a n k (I d - F) h o (I d - F)

exists. However, the family referenced above shows that finding one shall not be trivial.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

This page was built for publication: A gap for PPT entanglement