Recently some descriptions to characterize partially transposed (PPT) sates were obtained. In this note we focus the two of them and discuss their relation.
Given two bipartite quantum states and the convex linear combination of them, we discuss the relation between the entanglement of the convex linear combination state and the entanglement of states being combined. This is achieved by characterizing quantum states quantitatively via the positive partial transpose (PPT) criterion and the computable cross-norm or realignment (CCNR) criterion. Inspired by the Horodecki's 3 ⊗ 3 quantum states, we also give explicit examples to illustrate all possible cases of convex linear combination. Finally, as an application of this method, we show how to construct new bipartite PPT entangled states from known PPT entangled states by convex linear combination.
Let W be a Wishart random matrix of size d 2 × d 2 , considered as a block matrix with d × d blocks. Let Y be the matrix obtained by transposing each block of W. We prove that the empirical eigenvalue distribution of Y approaches a non-centered semicircular distribution when d → ∞. We also show the convergence of extreme eigenvalues towards the edge of the expected spectrum. The proofs are based on the moments method. This matrix model is relevant to Quantum Information Theory and corresponds to the partial transposition of a random induced state. A natural question is: "When does a random state have a positive partial transpose (PPT)?". We answer this question and exhibit a strong threshold when the parameter from the Wishart distribution equals 4. When d gets large, a random state on C d ⊗ C d obtained after partial tracing a random pure state over some ancilla of dimension αd 2 is typically PPT when α > 4 and typically non-PPT when α < 4.