Irreversibility for all bound entangled states

We derive a new inequality for entanglement for a mixed four-partite state. Employing this inequality, we present a one-shot lower bound for entanglement cost and prove that entanglement cost is strictly larger than zero for any entangled state. We demonstrate that irreversibility occurs in the process of formation for all non-distillable entangled states. In this way we solve a long standing problem, of how "real" is entanglement of bound entangled states. Using the new inequality we also prove impossibility of local-cloning of a known entangled state.Comment: The publication version. As noted in quant-ph/0510035, the result also implies that the mathematical definition of entangled states is equivalent to the physical definition in the sense of states preparation by LOC

Classical information deficit and monotonicity on local operations

We investigate classical information deficit: a candidate for measure of classical correlations emerging from thermodynamical approach initiated in [Phys. Rev. Lett 89, 180402]. It is defined as a difference between amount of information that can be concentrated by use of LOCC and the information contained in subsystems. We show nonintuitive fact, that one way version of this quantity can increase under local operation, hence it does not possess property required for a good measure of classical correlations. Recently it was shown by Igor Devetak, that regularised version of this quantity is monotonic under LO. In this context, our result implies that regularization plays a role of "monotoniser".Comment: 6 pages, revte

Local versus non-local information in quantum information theory: formalism and phenomena

In spite of many results in quantum information theory, the complex nature of compound systems is far from being clear. In general the information is a mixture of local, and non-local ("quantum") information. To make this point more clear, we develop and investigate the quantum information processing paradigm in which parties sharing a multipartite state distill local information. The amount of information which is lost because the parties must use a classical communication channel is the deficit. This scheme can be viewed as complementary to the notion of distilling entanglement. After reviewing the paradigm, we show that the upper bound for the deficit is given by the relative entropy distance to so-called psuedo-classically correlated states; the lower bound is the relative entropy of entanglement. This implies, in particular, that any entangled state is informationally nonlocal i.e. has nonzero deficit. We also apply the paradigm to defining the thermodynamical cost of erasing entanglement. We show the cost is bounded from below by relative entropy of entanglement. We demonstrate the existence of several other non-local phenomena. For example,we prove the existence of a form of non-locality without entanglement and with distinguishability. We analyze the deficit for several classes of multipartite pure states and obtain that in contrast to the GHZ state, the Aharonov state is extremely nonlocal (and in fact can be thought of as quasi-nonlocalisable). We also show that there do not exist states, for which the deficit is strictly equal to the whole informational content (bound local information). We then discuss complementary features of information in distributed quantum systems. Finally we discuss the physical and theoretical meaning of the results and pose many open questions.Comment: 35 pages in two column, 4 figure

On asymptotic continuity of functions of quantum states

A useful kind of continuity of quantum states functions in asymptotic regime is so-called asymptotic continuity. In this paper we provide general tools for checking if a function possesses this property. First we prove equivalence of asymptotic continuity with so-called it robustness under admixture. This allows us to show that relative entropy distance from a convex set including maximally mixed state is asymptotically continuous. Subsequently, we consider it arrowing - a way of building a new function out of a given one. The procedure originates from constructions of intrinsic information and entanglement of formation. We show that arrowing preserves asymptotic continuity for a class of functions (so-called subextensive ones). The result is illustrated by means of several examples.Comment: Minor corrections, version submitted for publicatio