arXiv subjects

Michal Horodecki

Publications and source records attributed to Michal Horodecki.

At least 37 records · Page 2Linked to original sources

arXiv2013

Exponential Quantum Speed-ups are Generic

A central problem in quantum computation is to understand which quantum circuits are useful for exponential speed-ups over classical computation. We address this question in the setting of query complexity and show that for almost any sufficiently long quantum circuit one can construct a black-box problem which is solved by the circuit with a constant number of quantum queries, but which requires exponentially many classical queries, even if the classical machine has the ability to postselect. We prove the result in two steps. In the first, we show that almost any element of an approximate unitary 3-design is useful to solve a certain black-box problem efficiently. The problem is based on a recent oracle construction of Aaronson and gives an exponential separation between quantum and classical bounded-error with postselection query complexities. In the second step, which may be of independent interest, we prove that linear-sized random quantum circuits give an approximate unitary 3-design. The key ingredient in the proof is a technique from quantum many-body theory to lower bound the spectral gap of local quantum Hamiltonians.

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

Quantum mutual independence

We introduce the concept of mutual independence -- correlations shared between distant parties which are independent of the environment. This notion is more general than the standard idea of a secret key -- it is a fully quantum and more general form of privacy. The states which possess mutual independence also generalize the so called private states -- those that possess private key. We then show that the problem of distributed compression of quantum information at distant sources can be solved in terms of mutual independence, if free entanglement between the senders and the receiver is available. Namely, we obtain a formula for the sum of rates of qubits needed to transmit a distributed state between Alice and Bob to a decoder Charlie. We also show that mutual independence is bounded from above by the relative entropy modulo a conjecture, saying that if after removal of a single qubit the state becomes product, its initial entanglement is bounded by 1. We suspect that mutual independence is a highly singular quantity, i.e. that it is positive only on a set of measure zero; furthermore, we believe that its presence is seen on the single copy level. This appears to be born out in the classical case.

quant-ph↗

arXiv2009

Squashed entanglement for multipartite states and entanglement measures based on the mixed convex roof

New measures of multipartite entanglement are constructed based on two definitions of multipartite information and different methods of optimizing over extensions of the states. One is a generalization of the squashed entanglement where one takes the mutual information of parties conditioned on the state's extension and takes the infimum over such extensions. Additivity of the multipartite squashed entanglement is proved for both versions of the multipartite information which turn out to be related. The second one is based on taking classical extensions. This scheme is generalized, which enables to construct measures of entanglement based on the {\it mixed convex roof} of a quantity, which in contrast to the standard convex roof method involves optimization over all decompositions of a density matrix rather than just the decompositions into pure states. As one of the possible applications of these results we prove that any multipartite monotone is an upper bound on the amount of multipartite distillable key. The findings are finally related to analogous results in classical key agreement.

quant-ph↗

arXiv2009

On Hastings' counterexamples to the minimum output entropy additivity conjecture

Hastings recently reported a randomized construction of channels violating the minimum output entropy additivity conjecture. Here we revisit his argument, presenting a simplified proof. In particular, we do not resort to the exact probability distribution of the Schmidt coefficients of a random bipartite pure state, as in the original proof, but rather derive the necessary large deviation bounds by a concentration of measure argument. Furthermore, we prove non-additivity for the overwhelming majority of channels consisting of a Haar random isometry followed by partial trace over the environment, for an environment dimension much bigger than the output dimension. This makes Hastings' original reasoning clearer and extends the class of channels for which additivity can be shown to be violated.

quant-ph↗

arXiv2008

An additive and operational entanglement measure: conditional entanglement of mutual information

Based on the monogamy of entanglement, we develop the technique of quantum conditioning to build an {\it additive} entanglement measure: the conditional entanglement of mutual information. Its {\it operational} meaning is elaborated to be the minimal net "flow of qubits" in the process of partial state merging. The result and conclusion can also be generalized to multipartite entanglement cases.

quant-ph↗

arXiv2008

Towards a unified approach to information-disturbance tradeoffs in quantum measurements

We show that the global balance of information dynamics for general quantum measurements given in [F. Buscemi, M. Hayashi, and M. Horodecki, Phys.Rev.Lett. 100, 210504 (2008)] makes it possible to unify various and generally inequivalent approaches adopted in order to derive information-disturbance tradeoffs in quantum theory. We focus in particular on those tradeoffs, constituting the vast majority of the literature on the subject, where disturbance is defined either in terms of average output fidelity or of entanglement fidelity.

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

General paradigm for distilling classical key from quantum states

We develop a formalism for distilling a classical key from a quantum state in a systematic way, expanding on our previous work on secure key from bound entanglement [K. Horodecki et. al., Phys. Rev. Lett. 94 (2005)]. More detailed proofs, discussion and examples are provided of the main results. Namely, we demonstrate that all quantum cryptographic protocols can be recast in a way which looks like entanglement theory, with the only change being that instead of distilling EPR pairs, the parties distill private states. The form of these general private states are given, and we show that there are a number of useful ways of expressing them. Some of the private states can be approximated by certain states which are bound entangled. Thus distillable entanglement is not a requirement for a private key. We find that such bound entangled states are useful for a cryptographic primitive we call a controlled private quantum channel. We also find a general class of states which have negative partial transpose (are NPT), but which appear to be bound entangled. The relative entropy distance is shown to be an upper bound on the rate of key. This allows us to compute the exact value of distillable key for a certain class of private states.

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

Global information balance in quantum measurements

We perform an information-theoretical analysis of quantum measurement processes and obtain the global information balance in quantum measurements, in the form of a closed chain equation for quantum mutual entropies. Our balance provides a tight and general entropic information-disturbance trade-off, and explains the physical mechanism underlying it. Finally, the single-outcome case, that is, the case of measurements with post-selection, is briefly discussed.

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↗

arXiv2008

Quantum coding theorem from privacy and distinguishability

We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

quant-ph↗

arXiv2007

Quantum key distribution based on private states: unconditional security over untrusted channels with zero quantum capacity

We prove unconditional security for a quantum key distribution (QKD) protocol based on distilling pbits (twisted ebits) [quant-ph/0309110] from an arbitrary untrusted state that is claimed to contain distillable key. Our main result is that we can verify security using only public communication -- via parameter estimation of the given untrusted state. The technique applies even to bound entangled states, thus extending QKD to the regime where the available quantum channel has zero quantum capacity. We also show how to convert our purification-based QKD schemes to prepare-measure schemes.

quant-ph↗

arXiv2007

Conditional Entanglement

Based on the ideas of {\it quantum extension} and {\it quantum conditioning}, we propose a generic approach to construct a new kind of entanglement measures called {\it conditional entanglement}. The new measures, built from the known entanglement measures, are convex, automatically {\it super-additive}, and even smaller than the regularized versions of the generating measures. More importantly, new measures can also be built directly from measures of correlations, enabling us to introduce an {\it additive} measure and generalize it to a multipartite entanglement measure.

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↗