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.

22 1. Characterizing entanglement<br />

extensions. This is currently under our investigation, but no significant<br />

progress has been achieved yet.<br />

1.3.3.3. Entanglement-induced ordering of states. Let us remark that having so many<br />

entanglement measures (of which only a small portion has been recalled here) means<br />

in particular that different orderings are induced on the set of entangled states. One<br />

can show that any two LOCC-monotone entanglement measures can only impose<br />

the same ordering on the set of entangled states, if they are actually exactly the<br />

same measure [255]. Therefore there exist in general pairs of states ϱA and ϱB<br />

such that E ′ (ϱA) > E ′ (ϱB) and E ′′ (ϱA) < E ′′ (ϱB), according to two different<br />

entanglement monotones E ′ (ϱ) and E ′′ (ϱ) (see Sec. 4.5 for an explicit analysis in<br />

the case of two-mode Gaussian states [GA7]). Given the wide range of tasks that<br />

exploit entanglement [163], one might understand that the motivations behind the<br />

definitions of entanglement as ‘that property which is exploited in such protocols’<br />

are manifold. This means that situations will almost certainly arise where a state ϱA<br />

is better than another state ϱB for achieving one task, but for achieving a different<br />

task ϱB is better than ϱA. Consequently, the fact that using a task-based approach<br />

to quantifying entanglement will certainly not lead to a single unified perspective,<br />

is somehow expected.<br />

In this respect, it is important to know that (in finite-dimensional Hilbert<br />

spaces) all bipartite entangled states are useful for quantum information processing<br />

[151]. For a long time the quantum information community has used a ‘negative’<br />

characterization of the term entanglement, essentially defining entangled states as<br />

those that cannot be created by LOCC alone [188]. However, remarkably, it has<br />

been recently shown that for any non-separable state ϱ according to Def. 2, one<br />

can find another state σ whose teleportation fidelity may be enhanced if ϱ is also<br />

present 4 [151, 150, 35]. This is interesting as it allows us to positively characterize<br />

non-separable states as those possessing a useful resource that is not present in<br />

separable states. The synonymous use of the terms non-separable and entangled is<br />

hence justified.<br />

1.4. Multipartite entanglement sharing and monogamy constraints<br />

It is a central trait of quantum information theory that there exist limitations to<br />

the free sharing of quantum correlations among multiple parties. Such monogamy<br />

constraints have been introduced in a landmark paper by Coffman, Kundu and<br />

Wootters, who derived a quantitative inequality expressing a trade-off between the<br />

couplewise and the genuine tripartite entanglement for states of three qubits [59].<br />

Since then, a lot of efforts have been devoted to the investigation of distributed entanglement<br />

in multipartite quantum systems. In this Section, based on Ref. [GA12],<br />

we report in a unifying framework a bird’s eye view of the most relevant results<br />

that have been established so far on entanglement sharing. We will take off from<br />

the domain of N qubits, graze qudits (i.e. d-dimensional quantum systems), and<br />

drop the premises for the fully continuous-variable analysis of entanglement sharing<br />

in Gaussian states which will presented in Part III.<br />

4 We have independently achieved a somehow similar operational interpretation for (generally<br />

multipartite) continuous-variable entanglement of symmetric Gaussian states in terms of optimal<br />

teleportation fidelity [GA9], as will be discussed in Sec. 12.2.

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

Saved successfully!

Ooh no, something went wrong!