arXiv subjects

Karol Horodecki

Publications and source records attributed to Karol Horodecki.

61 records · Page 4Linked to original sources

arXiv2005

Low dimensional bound entanglement with one-way distillable cryptographic key

We provide a class of bound entangled states that have positive distillable secure key rate. The smallest state of this kind is $4 \otimes 4$, which shows that peculiar security contained in bound entangled states does not need high dimensional systems. We show, that for these states a positive key rate can be obtained by {\it one-way} Devetak-Winter protocol. Subsequently the volume of bound entangled key-distillable states in arbitrary dimension is shown to be nonzero. We provide a scheme of verification of cryptographic quality of experimentally prepared state in terms of local observables. Proposed set of 7 collective settings is proven to be optimal in number of settings.

quant-ph↗

arXiv2005

Secure key from bound entanglement

We characterize the set of shared quantum states which contain a cryptographically private key. This allows us to recast the theory of privacy as a paradigm closely related to that used in entanglement manipulation. It is shown that one can distill an arbitrarily secure key from bound entangled states. There are also states which have less distillable private key than the entanglement cost of the state. In general the amount of distillable key is bounded from above by the relative entropy of entanglement. Relationships between distillability and distinguishability are found for a class of states which have Bell states correlated to separable hiding states. We also describe a technique for finding states exhibiting irreversibility in entanglement distillation.

quant-ph↗

arXiv2004

Bounds on localisable information via semidefinite programming

We investigate so-called localisable information of bipartite states and a parallel notion of information deficit. Localisable information is defined as the amount of information that can be concentrated by means of classical communication and local operations where only maximally mixed states can be added for free. The information deficit is defined as difference between total information contents of the state and localisable information. We consider a larger class of operations: the so called PPT operations, which in addition preserve maximally mixed state (PPT-PMM operations). We formulate the related optimization problem as sedmidefnite program with suitable constraints. We then provide bound for fidelity of transition of a given state into product pure state on Hilbert space of dimension d. This allows to obtain general upper bound for localisable information (and also for information deficit). We calculated the bounds exactly for Werner states and isotropic states in any dimension. Surprisingly it turns out that related bounds for information deficit are equal to relative entropy of entanglement (in the case of Werner states - regularized one). We compare the upper bounds with lower bounds based on simple protocol of localisation of information.

quant-ph↗

arXiv2004

Locking entanglement measures with a single qubit

We study the loss of entanglement of bipartite state subjected to discarding or measurement of one qubit. Examining the behavior of different entanglement measures, we find that entanglement of formation, entanglement cost, and logarithmic negativity are lockable measures in that it can decrease arbitrarily after measuring one qubit. We prove that any convex and asymptotically non-continuous measure is lockable. As a consequence, all the convex roof measures can be locked. Relative entropy of entanglement is shown to be a non-lockable measure.

quant-ph↗

arXiv2003

Information as a resource in distributed quantum systems

A new paradigm for distributed quantum systems where information is a valuable resource is developed. After finding a unique measure for information, we construct a scheme for it's manipulation in analogy with entanglement theory. In this scheme instead of maximally entangled states, two parties distill local states. We show that, surprisingly, the main tools of entanglement theory are general enough to work in this opposite scheme. Up to plausible assumptions, we show that the amount of information that must be lost during the protocol of concentration of local information can be expressed as the relative entropy distance from some special set of states.

quant-ph↗

arXiv2002

A new type of complementarity between quantum and classical information

Physical systems contain information which can be divided between classical and quantum information. Classical information is locally accessible and allows one to perform tasks such as physical work, while quantum information allows one to perform tasks such as teleportation. It is shown that these two kinds of information are complementarity in the sense that two parties can either gain access to the quantum information, or to the classical information but not both. This complementarity has a form very similar to the complementarities usually encountered in quantum mechanics. For pure states, the entanglement plays the role of Planck's constant. We also find another class of complementarity relations which applies to operators, and is induced when two parties can only perform local operations and communicate classical. In order to formalize this notion we define the restricted commutator. Observables such as the parity and phase of two qubits commute, but their restricted commutator is non-zero. It is also found that complementarity is pure in the sense that can be ''decoupled'' from the uncertainty principle.

quant-ph↗

arXiv2002

Local indistinguishability and LOCC monotones

We provide a method for checking indistinguishability of a set of multipartite orthogonal states by local operations and classical communication (LOCC). It bases on the principle of nonincreasing of entanglement under LOCC. This method originates from the one introduced by Ghosh \emph{et al.} (Phys. Rev. Lett. \textbf{87}, 5807 (2001) (quant-ph/0106148)), though we deal with {\emph pure} states. In the bipartite case, our method is operational, although we do not know whether it can always detect local indistinguishability. We apply our method to show that an arbitrary complete multipartite orthogonal basis is indistinguishable if it contains at least one entangled state. We also show that probabilistic distinguishing is possible for full basis if and only if all vectors are product. We employ our method to prove local indistinguishability in a very interesting example akin to "nonlocality without entanglement".

quant-ph↗