arXiv subjects

Ryszard Horodecki

Publications and source records attributed to Ryszard Horodecki.

At least 37 records · Page 2Linked to original sources

arXiv2013

Conjectured strong complementary-correlations tradeoff

We conjecture new uncertainty relations which restrict correlations between results of measurements performed by two separated parties on a shared quantum state. The first uncertainty relation bounds the sum of two mutual informations when one party measures a single observable and the other party measures one of two observables. The uncertainty relation does not follow from Maassen-Uffink uncertainty relation and is much stronger than Hall uncertainty relation derived from the latter. The second uncertainty relation bounds the sum of two mutual informations when each party measures one of two observables. We provide numerical evidence for validity of conjectured uncertainty relations and prove them for large classes of states and observables.

quant-ph↗

arXiv2013

Separability in terms of a single entanglement witness

The separability problem is formulated in terms of a characterization of a single entanglement witness. More specifically, we show that any (in general multipartite) state \varrho is separable if and only if a specially constructed entanglement witness W_{\varrho} is weakly optimal, i.e., its expectation value vanishes on at least one product vector. Interestingly, the witness can always be chosen to be decomposable. Our result changes the conceptual aspect of the separability problem and rises some questions about properties of positive maps.

quant-ph↗

arXiv2010

Contextuality offers security

The discovery of quantum key distribution by Bennett and Brassard (BB84) bases on the fundamental quantum feature: incompatibility of measurements of quantum non-commuting observables. In 1991 Ekert showed that cryptographic key can be generated at a distance with help of entangled (correlated) quantum particles. Recently Barrett, Hardy and Kent showed that the non-locality used by Ekert is itself a good resource of cryptographic key even beyond quantum mechanics. Their result paved the way to new generation of quantum cryptographic protocols - secure even if the devices are built by the very eavesdropper. However, there is a question, which is fundamental from both practical and philosophical point of view: does Nature offer security on operational level based on the original concept behind quantum cryptography - that information gain about one bservables must cause disturbance to another, incompatible one? Here we resolve this problem by using in place of non-locality another striking feature of quantum world - contextuality. It is a strong version of incompatibility manifested in the famous Kochen-Specker paradox. The crucial concept is the use of a new class of families of bipartite probability distributions which locally exhibit the Kochen-Specker paradox conditions and, in addition, exhibit perfect correlations. We show that if two persons share systems described by such a family then they can extract secure key. This is the first operational protocol that directly implements the fundamental feature of Nature: the information gain vs. disturbance trade-off. At the same time it provides natural device-independent cryptographic scheme within quantum mechanics suitable for current technology.

quant-ph↗

arXiv2010

Contextuality offers device-independent security

The discovery of quantum key distribution by Bennett and Brassard (BB84) bases on the fundamental quantum feature: incompatibility of measurements of quantum non-commuting observables. In 1991 Ekert showed that cryptographic key can be generated at a distance with help of entangled (correlated) quantum particles. Recently Barrett, Hardy and Kent showed that the non-locality used by Ekert is itself a good resource of cryptographic key even beyond quantum mechanics. Their result paved the way to new generation of quantum cryptographic protocols - secure even if the devices are built by the very eavesdropper. However, there is a question, which is fundamental from both practical and philosophical point of view: does Nature offer security on operational level based on the original concept behind quantum cryptography - that information gain about one observable must cause disturbance to another, incompatible one? Here we resolve this problem by using another striking feature of quantum world - contextuality. It is a strong version of incompatibility manifested in the famous Kochen-Specker paradox. The crucial concept is the use of a new class of families of bipartite probability distributions . We show that if two persons share systems which locally exhibit the Kochen-Specker paradox and, in addition, exhibit perfect correlations, then they can extract secure key, even if they do not trust the quantum devices. This is the first operational protocol that directly implements the fundamental feature of Nature: the information gain vs. disturbance trade-off. For sake of proof we exhibit a new Bell's inequality which is interesting in itself. The security is proved not by exploiting strong violation of the inequality by quantum mechanics (as one usually proceeds), but rather by arguing, that quantum mechanics cannot violate it too much.

quant-ph↗

arXiv2010

Postulates for measures of genuine multipartite correlations

A lot of research has been done on multipartite correlations. However, it seems strange that there is no definition of so called genuine multipartite correlations. In this paper we propose three reasonable postulates which each measure or indicator of genuine multipartite correlations (or genuine multipartite entanglement) should satisfy. We also introduce degree of correlations which gives partial characterization of multipartite correlations. Then, we show that covariance does not satisfy two postulates and hence, it cannot be used as an indicator of genuine multipartite correlations. Finally, we propose candidate for a measure of genuine multipartite correlations based on the work that can be drawn from local bath by means of a multipartite state.

quant-ph↗

arXiv2009

When non i.i.d. information sources can be communicationally useful?

Information sources used for communication purposes usually are assumed to be i.i.d. type, especially as far as entanglement or nonlocality properties are concerned. Here we proposed simple scheme for detection of nonlocality of non i.i.d. sources based on the program idea which can be useful in communication tasks including quantum cryptography and communication complexity reduction. The principle of the scheme is rather general and can be applied to other problems like detection of entanglement coming from non-i.i.d sources.

quant-ph↗

arXiv2008

Entanglement-redistribution boxes

We establish a framework to study the classical-communication properties of primitive local operations assisted by classical communication which realize various redistributions of entanglement, like, e.g., entanglement swapping. On the one hand, we analyze what local operations and how much classical communication are needed to perform them. On the other hand, we investigate whether and to what extent such primitives can help to establish classical communication when they are used in the form of black boxes available to spatially-separated users. In particular, we find that entanglement swapping costs more communication than it can signal; in this sense, entanglement swapping is a weaker primitive than quantum teleportation.

quant-ph↗

arXiv2008

Entanglement-swapping boxes and their communication properties

We pose the fundamental question of communication properties of primitives irrespectively of their implementation. To illustrate the idea we introduce the concept of entanglement-swapping boxes, i.e. we consider any quantum operations which perform entanglement swapping, not necessarily via simple quantum teleportation. We ask a question about the properties of such boxes., i.e. what local operations and how much classical communication are needed to perform them. We also ask if any box which performs entanglement swapping can be used to establish classical communication. We show that each box needs at least two bits of classical communication to perform it. It is also shown that each box can be used for classical communication and, most importantly, that there exist boxes which allow to communicate at most one bit. Surprisingly we find basic irreversibility in the process of entanglement swapping with respect to its communication properties.

quant-ph↗

arXiv2008

Note on genuine multipartite classical correlations

We discuss the problem of coexistence of genuine quantum multipartite correlations and classical multipartite correlations. We introduce a postulate which any measure of genuine multipartite classical correlations should satisfy. We show that covariance does not satisfy this postulate. Finally we propose a definition of genuine multipartite correlations and illustrate it with examples.

quant-ph↗

arXiv2007

No-local-broadcasting theorem for quantum correlations

We prove that the correlations present in a multipartite quantum state have an \emph{operational} quantum character as soon as the state does not simply encode a multipartite classical probability distribution, i.e. does not describe the joint state of many classical registers. Even unentangled states may exhibit such \emph{quantumness}, that is pointed out by the new task of \emph{local broadcasting}, i.e. of locally sharing pre-established correlations: this task is feasible if and only if correlations are classical and derive a no-local-broadcasting theorem for quantum correlations. Thus, local broadcasting is able to point out the quantumness of correlations, as standard broadcasting points out the quantum character of single system states. Further, we argue that our theorem implies the standard no-broadcasting theorem for single systems, and that our operative approach leads in a natural way to the definition of measures for quantumness of correlations.

quant-ph↗

arXiv2007

Quantum entanglement

All our former experience with application of quantum theory seems to say: {\it what is predicted by quantum formalism must occur in laboratory}. But the essence of quantum formalism - entanglement, recognized by Einstein, Podolsky, Rosen and Schrödinger - waited over 70 years to enter to laboratories as a new resource as real as energy. This holistic property of compound quantum systems, which involves nonclassical correlations between subsystems, is a potential for many quantum processes, including ``canonical'' ones: quantum cryptography, quantum teleportation and dense coding. However, it appeared that this new resource is very complex and difficult to detect. Being usually fragile to environment, it is robust against conceptual and mathematical tools, the task of which is to decipher its rich structure. This article reviews basic aspects of entanglement including its characterization, detection, distillation and quantifying. In particular, the authors discuss various manifestations of entanglement via Bell inequalities, entropic inequalities, entanglement witnesses, quantum cryptography and point out some interrelations. They also discuss a basic role of entanglement in quantum communication within distant labs paradigm and stress some peculiarities such as irreversibility of entanglement manipulations including its extremal form - bound entanglement phenomenon. A basic role of entanglement witnesses in detection of entanglement is emphasized.

quant-ph↗

arXiv2006

On some entropic entanglement parameter

In this paper we present the quantity, which is an entanglement parameter. Its origin is very intriguing, because its construction is motivated by separability criteria based on uncertainty relation. We show that this quantity is asymptotically continuous. We also find the lower and upper bounds for it. Our entanglement parameter has the same feature as the coherent information: both can be negative. There are also some classes of states for which these quantities coincide with each other.

quant-ph↗

arXiv2005

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.

quant-ph↗

arXiv2005

Towards efficient algorithm deciding separability of distributed quantum states

It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly exponentially with the state's rank. Nevertheless, we argue that for generic states, analysis of concurrence matrices essentially reduces the task of solving separability problem in $m \times n$ dimensions to solving a set of linear equations in about $\binom{mn+D-1}{D}$ variables, where $D$ decreases with $mn$ and for large $mn$ it should not exceed 4. Moreover, the same method is also applicable to multipartite states where it is at least equally efficient.

quant-ph↗

arXiv2005

Optimal strategy for a single-qubit gate and trade-off between opposite types of decoherence

We study reliable quantum information processing (QIP) under two different types of environment. First type is Markovian exponential decay, and the appropriate elementary strategy of protection of qubit is to apply fast gates. The second one is strongly non-Markovian and occurs solely during operations on the qubit. The best strategy is then to work with slow gates. If the two types are both present, one has to optimize the speed of gate. We show that such a trade-off is present for a single-qubit operation in a semiconductor quantum dot implementation of QIP, where recombination of exciton (qubit) is Markovian, while phonon dressing gives rise to the non-Markovian contribution.

quant-ph↗

arXiv2004

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.

quant-ph↗

arXiv2004

Common origin of no-cloning and no-deleting principles - Conservation of information

We discuss the role of the notion of information in the description of physical reality. We consider theories for which dynamics is linear with respect to stochastic mixing. We point out that the no-cloning and no-deleting principles emerge in any such theory, if law of conservation of information is valid, and two copies contain more information than one copy. We then describe the quantum case from this point of view.

quant-ph↗

arXiv2004

Thermodynamics of quantum informational systems - Hamiltonian description

It is often claimed, that from a quantum system of d levels, and entropy S and heat bath of temperature T one can draw kT(ln d -S) amount of work. However, the usual arguments based on Szilard engine are not fully rigorous. Here we prove the formula within Hamiltonian description of drawing work from a quantum system and a heat bath, at a cost of entropy of the system. We base on the derivation of thermodynamical laws and quantities in [R. Alicki, J. Phys. A, 12, L103 (1979)] within a weak coupling limit. Our result provides fully physical scenario for extracting thermodynamical work from quantum correlations [J. Oppenheim et al. Phys. Rev. Lett. 89, 180402 (2002)]. We also derive Landauer principle as a consquence of second law within the considered model.

quant-ph↗