arXiv subjects

Jonathan Oppenheim

Publications and source records attributed to Jonathan Oppenheim.

At least 73 records · Page 4Linked to original sources

arXiv2010

The uncertainty principle determines the non-locality of quantum mechanics

Two central concepts of quantum mechanics are Heisenberg's uncertainty principle, and a subtle form of non-locality that Einstein famously called ``spooky action at a distance''. These two fundamental features have thus far been distinct concepts. Here we show that they are inextricably and quantitatively linked. Quantum mechanics cannot be more non-local with measurements that respect the uncertainty principle. In fact, the link between uncertainty and non-locality holds for all physical theories.More specifically, the degree of non-locality of any theory is determined by two factors -- the strength of the uncertainty principle, and the strength of a property called ``steering'', which determines which states can be prepared at one location given a measurement at another.

quant-ph↗

arXiv2010

Public Quantum Communication and Superactivation

Is there a meaningful quantum counterpart to public communication? We argue that the symmetric-side channel -- which distributes quantum information symmetrically between the receiver and the environment -- is a good candidate for a notion of public quantum communication in entanglement distillation and quantum error correction. This connection is partially motivated by [Brandão and Oppenheim, arXiv:1004.3328], where it was found that if a sender would like to communicate a secret message to a receiver through an insecure quantum channel using a shared quantum state as a key, then the insecure quantum channel is only ever used to simulate a symmetric-side channel, and can always be replaced by it without altering the optimal rate. Here we further show, in complete analogy to the role of public classical communication, that assistance by a symmetric-side channel makes equal the distillable entanglement, the recently-introduced mutual independence, and a generalization of the latter, which quantifies the extent to which one of the parties can perform quantum privacy amplification. Symmetric-side channels, and the closely related erasure channel, have been recently harnessed to provide examples of superactivation of the quantum channel capacity. Our findings give new insight into this non-additivity of the channel capacity and its relation to quantum privacy. In particular, we show that single-copy superactivation protocols with the erasure channel, which encompasses all examples of non-additivity of the quantum capacity found to date, can be understood as a conversion of mutual independence into distillable entanglement.

quant-ph↗

arXiv2010

The quantum one-time pad in the presence of an eavesdropper

A classical one-time pad allows two parties to send private messages over a public classical channel -- an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state which allows two parties to send private messages or private quantum states over a public quantum channel. If the eavesdropper intercepts the quantum communication she learns nothing about the message. In the classical case, a one-time pad can be created using shared and partially private correlations. Here we consider the quantum case in the presence of an eavesdropper, and find the single letter formula for the rate at which the two parties can send messages using a quantum one-time pad.

quant-ph↗

arXiv2010

For quantum information, two wrongs can make a right

Superactivation is the phenomenon where two quantum channels which individually have zero-capacity can have positive capacity when used together. The perspective given here provides an intuitive explanation of this discovery by Smith and Yard, and gives a protocol to activate any private channel.

quant-ph↗

arXiv2009

Quantum network communication -- the butterfly and beyond

We study the k-pair communication problem for quantum information in networks of quantum channels. We consider the asymptotic rates of high fidelity quantum communication between specific sender-receiver pairs. Four scenarios of classical communication assistance (none, forward, backward, and two-way) are considered. (i) We obtain outer and inner bounds of the achievable rate regions in the most general directed networks. (ii) For two particular networks (including the butterfly network) routing is proved optimal, and the free assisting classical communication can at best be used to modify the directions of quantum channels in the network. Consequently, the achievable rate regions are given by counting edge avoiding paths, and precise achievable rate regions in all four assisting scenarios can be obtained. (iii) Optimality of routing can also be proved in classes of networks. The first class consists of directed unassisted networks in which (1) the receivers are information sinks, (2) the maximum distance from senders to receivers is small, and (3) a certain type of 4-cycles are absent, but without further constraints (such as on the number of communicating and intermediate parties). The second class consists of arbitrary backward-assisted networks with 2 sender-receiver pairs. (iv) Beyond the k-pair communication problem, observations are made on quantum multicasting and a static version of network communication related to the entanglement of assistance.

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

Fundamental destruction of information and conservation laws

Theories which have fundamental information destruction or decoherence are motivated by the black hole information paradox where one appears to have pure states evolving into mixed states. However such theories have either violated conservation laws, or are highly non-local. Here, we show that the tension between conservation laws and locality can be circumvented by constructing a relational theory of information destruction. In terms of conservation laws, we derive a generalisation of Noether's theorem for general theories, and show that symmetries imply a strong restriction on the type of evolution permissable. With respect to locality, we distinguish violations of causality from the creation or destruction of space-like seperated correlations. We show that violations of causality need not occur in a relational framework, although one can have situations where correlations decay faster than one might otherwise expect or can be created over spatial distances. This creation or destruction of correlations cannot be used to signal superluminally, and thus no violation of causality occurs. We prove that theories with information destruction can be made time-symmetric, thus impossing no arrow of time.

hep-th↗

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

State redistribution as merging: introducing the coherent relay

State redistribution allows one party to optimally send part of her state to another party. Here we show that this can be derived simply from two applications of coherent state-merging. This provides a protocol whereby a middle party acts as a relay station to help another party more efficiently transfer quantum states. This also gives a protocol for state splitting and the reverse Shannon theorem (assisted or unassisted by side information), and allows one to use less classical communication for partial state-merging using a sub-protocol we call ebit repackaging. Thus state-merging generates the other primitives of quantum communication theory, reducing the hierarchy between members of the first family of quantum protocols.

quant-ph↗

arXiv2008

A classical analogue of negative information

Recently, it was discovered that the `quantum partial information' needed to merge one party's state with another party's state is given by the conditional entropy, which can be negative [Horodecki, Oppenheim, and Winter, Nature 436, 673 (2005)]. Here we find a classical analogue of this, based on a long known relationship between entanglement and shared private correlations: namely, we consider a private distribution held between two parties, and correlated to a reference system, and ask how much secret communication is needed for one party to send her distribution to the other. We give optimal protocols for this task, and find that private information can be negative - the sender's distribution can be transferred and the potential to send future distributions in secret is gained through the distillation of a secret key. An analogue of `quantum state exchange' is also discussed and one finds cases where exchanging a distribution costs less than for one party to send it. The results give new classical protocols, and also clarify the various relationships between entanglement and privacy.

quant-ph↗

arXiv2008

Uncommon information (the cost of exchanging a quantum state)

If two parties share an unknown quantum state, one can ask how much quantum communication is needed for party A to send her share to party B. Recently, it was found that the number of qubits which should be sent is given by the conditional entropy. This quantifies the notion of partial information, and it can even be negative. Here, we not only demand that A send her state to B, but additionally, B should send his state to A. Paradoxically, we find that requiring that the parties perform this additional task can lower the amount of quantum communication required. This primitive, which we call quantum state exchange, can be used to quantify the notion of uncommon information, since the two parties only need to send each other the parts of their state they don't hold in common. In the classical case, the concept of uncommon information follows trivially from the concept of partial information. We find that for quantum states, this is not so. We prove upper and lower bounds for the uncommon information and find optimal protocols for several classes of states.

quant-ph↗

arXiv2008

A paradigm for entanglement theory based on quantum communication

Here it is shown that the squashed entanglement has an operational meaning -- it is the fastest rate at which a quantum state can be sent between two parties who share arbitrary side-information. Likewise, the entanglement of formation and entanglement cost is shown to be the fastest rate at which a quantum state can be sent when the parties have access to side-information which is maximally correlated. A further restriction on the type of side-information implies that the rate of state transmission is given by the quantum mutual information. This suggests a new paradigm for understanding entanglement and other correlations. Different types of side-information correspond to different types of correlations with the squashed entanglement being one extreme. The paradigm also allows one to classify states not only in terms of how much quantum communication is needed to transfer half of it, but also in terms of how much entanglement is needed. Furthermore, there is a dual paradigm: if one distributes the side-information as maliciously as possible so as to make the sending of the state as difficult as possible, one finds maximum rates which give interpretations to known quantities (such as the entanglement of assistance), as well as new ones. The infamous additivity questions can also be recast and receive an operational interpretation in terms of maximally correlated states.

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

Unifying classical and quantum key distillation

Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state. In addition, Alice and Bob can use local operations and authenticated public classical communication. Their goal is to establish a key which is unknown to Eve. We initiate the study of this scenario as a unification of two standard scenarios: (i) key distillation (agreement) from classical correlations and (ii) key distillation from pure tripartite quantum states. Firstly, we obtain generalisations of fundamental results related to scenarios (i) and (ii), including upper bounds on the key rate. Moreover, based on an embedding of classical distributions into quantum states, we are able to find new connections between protocols and quantities in the standard scenarios (i) and (ii). Secondly, we study specific properties of key distillation protocols. In particular, we show that every protocol that makes use of pre-shared key can be transformed into an equally efficient protocol which needs no pre-shared key. This result is of practical significance as it applies to quantum key distribution (QKD) protocols, but it also implies that the key rate cannot be locked with information on Eve's side. Finally, we exhibit an arbitrarily large separation between the key rate in the standard setting where Eve is equipped with quantum memory and the key rate in a setting where Eve is only given classical memory. This shows that assumptions on the nature of Eve's memory are important in order to determine the correct security threshold in QKD.

quant-ph↗

arXiv2007

Unconditional privacy over channels which cannot convey quantum information

By sending systems in specially prepared quantum states, two parties can communicate without an eavesdropper being able to listen. The technique, called quantum cryptography, enables one to verify that the state of the quantum system has not been tampered with, and thus one can obtain privacy regardless of the power of the eavesdropper. All previous protocols relied on the ability to faithfully send quantum states. In fact, until recently, they could all be reduced to a single protocol where security is ensured though sharing maximally entangled states. Here we show this need not be the case -- one can obtain verifiable privacy even through some channels which cannot be used to reliably send quantum states.

quant-ph↗

arXiv2007

Equilibrium temperature anisotropy and black-hole analogues

When long-range interactions are present the usual definition of temperature implies that two systems in thermal equilibrium can be at different temperatures. This local temperature has physical significance, if the sub-systems cease to interact, each system will be at their different local temperatures. This is formally related to redshifting of temperature in general relativity. We propose experiments to test this effect which are feasible using current microfabrication techniques. It is also possible to display thermodynamical analogues to black-hole space-time.

gr-qc↗

arXiv2005

Quantum state merging and negative information

We consider a quantum state shared between many distant locations, and define a quantum information processing primitive, state merging, that optimally merges the state into one location. As announced in [Horodecki, Oppenheim, Winter, Nature 436, 673 (2005)], the optimal entanglement cost of this task is the conditional entropy if classical communication is free. Since this quantity can be negative, and the state merging rate measures partial quantum information, we find that quantum information can be negative. The classical communication rate also has a minimum rate: a certain quantum mutual information. State merging enabled one to solve a number of open problems: distributed quantum data compression, quantum coding with side information at the decoder and sender, multi-party entanglement of assistance, and the capacity of the quantum multiple access channel. It also provides an operational proof of strong subadditivity. Here, we give precise definitions and prove these results rigorously.

quant-ph↗