Hybrid Zero-capacity Channels

There are only two known kinds of zero-capacity channels. The first kind produces entangled states that have positive partial transpose, and the second one - states that are cloneable. We consider the family of 'hybrid' quantum channels, which lies in the intersection of the above classes of channels and investigate its properties. It gives rise to the first explicit examples of the channels, which create bound entangled states that have the property of being cloneable to the arbitrary finite number of parties. Hybrid channels provide the first example of highly cloneable binding entanglement channels, for which known superactivation protocols must fail - superactivation is the effect where two channels each with zero quantum capacity having positive capacity when used together. We give two methods to construct a hybrid channel from any binding entanglement channel. We also find the low-dimensional counterparts of hybrid states - bipartite qubit states which are extendible and possess two-way key

Superadditivity of Private Information for Any Number of Uses of the Channel.

The quantum capacity of a quantum channel is always smaller than the capacity of the channel for private communication. Both quantities are given by the infinite regularization of the coherent and the private information, respectively, which makes their evaluation very difficult. Here, we construct a family of channels for which the private and coherent information can remain strictly superadditive for unbounded number of uses, thus demonstrating that the regularization is necessary. We prove this by showing that the coherent information is strictly larger than the private information of a smaller number of uses of the channel. This implies that even though the quantum capacity is upper bounded by the private capacity, the nonregularized quantities can be interleaved

Generalized teleportation and entanglement recycling

We introduce new teleportation protocols which are generalizations of the original teleportation protocols that use the Pauli group [Bennett, et al. Physical Review Letters, 70(13) 1895-1899] and the port-based teleportation protocols, introduced by Hiroshima and Ishizaka [Physical Review Letters, 101(24) 240501], that use the symmetric permutation group. We derive sufficient condition for a set of operations, which in general need not form a group, to give rise to a teleportation protocol and provide examples of such schemes. This generalization leads to protocols with novel properties and is needed to push forward new schemes of computation based on them. Port-based teleportation protocols and our generalizations use a large resource state consisting of N singlets to teleport only a single qubit state reliably. We provide two distinct protocols which recycle the resource state to teleport multiple states with error linearly increasing with their number. The first protocol consists of sequentially teleporting qubit states, and the second teleports them in a bulk

Game-theoretic characterization of antidegradable channels

We introduce a guessing game involving a quantum channel, three parties - the sender, the receiver and an eavesdropper, Eve - and a quantum public side channel. We prove that a necessary and sufficient condition for the quantum channel to be antidegradable, is that Eve wins the game. We thus obtain a complete operational characterization of antidegradable channels in a game-theoretic framework.Comment: v2: published version, 14 pages, 1 figure; v1: 13 pages, 1 figur

Quantum Capacity Can Be Greater Than Private Information for Arbitrarily Many Uses

The quantum capacity of a quantum channel is always smaller than the capacity of the channel for private communication. However, both quantities are given by the infinite regularization of respectively the coherent and the private information. Here, we construct a family of channels for which the private and coherent information can remain strictly superadditive for unbounded number of uses. We prove this by showing that the coherent information is strictly larger than the private information of a smaller number of uses of the channel. It turns out that even though the quantum capacity is upper bounded by the private capacity, the non-regularized quantities can be interleaved. From an operational point of view, the private capacity can be used for gauging the practical value of quantum channels for secure communication and, consequently, for key distribution. We thus show that in order to evaluate the interest a channel for this task it is necessary to optimize the private information over an unlimited number of uses of the channel

Optimal amount of entanglement to distinguish quantum states instantaneously

We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of entanglement required to accomplish the task perfectly for sets of orthogonal states and argue that it quantifies information nonlocality.This is the author accepted manuscript. The final version is available from the American Physical Society via http://dx.doi.org/10.1103/PhysRevA.92.05233