30.04.2013 Views

ENTANGLEMENT OF GAUSSIAN STATES Gerardo Adesso

ENTANGLEMENT OF GAUSSIAN STATES Gerardo Adesso

ENTANGLEMENT OF GAUSSIAN STATES Gerardo Adesso

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

1.3. Theory of bipartite entanglement 17<br />

1.3.2. Mixed states: entanglement vs separability<br />

A mixed state ϱ can be decomposed as a convex combination of pure states,<br />

ϱ = <br />

pk|ψk〉〈ψk| . (1.28)<br />

k<br />

Eq. (1.28) tells us how to create the state described by the density matrix ϱ: we<br />

have to prepare the state |ψ1〉 with probability p1, the state |ψ2〉 with probability<br />

p2, etc. For instance, we could collect N copies (N ≫ 1) of the system, prepare<br />

nk Npk of them in the state |ψk〉, and pick a random system.<br />

The problem is that the decomposition of Eq. (1.28) is not unique: unless<br />

ϱ is already a pure state, there exist infinitely many decompositions of a generic<br />

ϱ in ensembles of pure states, meaning that the mixed state can be prepared in<br />

infinitely many different ways. One can expect that this has some consequence on<br />

the entanglement. Let us suppose we have a bipartite system and we detect, by local<br />

measurements, the presence of correlations between the two subsystems. Given the<br />

ambiguity on the state preparation, we cannot know a priori if those correlations<br />

arose from a quantum interaction between the subsystems (meaning entanglement)<br />

or were induced by means of LOCC (meaning classical correlations). It is thus<br />

clear that a mixed state can be defined separable (classically correlated) if there<br />

exist at least one way of engineering it by LOCC; on the other hand it is entangled<br />

(quantumly correlated) if, among the infinite possible preparation procedures, there<br />

is no one which relies on LOCC only [264].<br />

Definition 2. A mixed quantum state ϱ of a bipartite system, described by the Hilbert<br />

space H = H1 ⊗ H2, is separable if and only if there exist coefficients {pk | pk ≥<br />

0, <br />

k pk = 1}, and states {σk} ∈ H1 and {τk} ∈ H2, such that<br />

ϱ = <br />

pk (σk ⊗ τk) . (1.29)<br />

Otherwise, ϱ is an entangled state.<br />

k<br />

For pure states, the expansion Eq. (1.29) has a single term and we recover<br />

Def. 1, i.e. the only separable pure states are product states. For mixed states, not<br />

only product states (containing zero correlations of any form) but in general any<br />

convex combination of product states is separable. This is obvious as the state of<br />

Eq. (1.29) contains only classical correlations, since it can be prepared by means of<br />

LOCC.<br />

However, Def. 2 is in all respects impractical. Deciding separability according<br />

to the above definition would imply checking all the infinitely many decomposition<br />

of a state ϱ and looking for at least one of the form Eq. (1.29), to conclude that<br />

the state is not entangled. This is clearly impossible. For this reason, several<br />

operational criteria have been developed in order to detect entanglement in mixed<br />

quantum states [144, 43, 143]. Two of them are discussed in the following.<br />

1.3.2.1. Positive Partial Transposition criterion. One of the most powerful results<br />

to date in the context of separability criteria is the Peres–Horodecki condition<br />

[178, 118]. It is based on the operation of partial transposition of the density<br />

matrix of a bipartite system, obtained by performing transposition with respect to<br />

the degrees of freedom of one subsystem only. Peres criterion states that, if a state<br />

ϱs is separable, then its partial transpose ϱ T1<br />

s (with respect e.g. to subsystem S1) is

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!