Related papers: Classical-Quantum Arbitrarily Varying Wiretap Chan…
In this article, we investigate the additivity phenomenon in the dynamic capacity of a quantum channel for trading classical communication, quantum communication and entanglement. Understanding such additivity property is important if we…
We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…
Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compare minor and major variations in the…
We establish a quantitative connection between the amount of lost classical information about a quantum state and the concomitant loss of entanglement. Using methods that have been developed for the optimal purification of mixed states we…
The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…
We consider the additivity of the minimal output entropy and the classical information capacity of a class of quantum channels. For this class of channels the norm of the output is maximized for the output being a normalized projection. We…
In this work we study the problem of communication over the quantum wiretap channel. For this channel there are three parties Alice (sender), Bob (legitimate receiver) and Eve (eavesdropper). We obtain upper and lower bounds on the amount…
We show an experimental procedure to certify the classical capacity for noisy qubit channels. The method makes use of a fixed bipartite entangled state, where the system qubit is sent to the channel input and the set of local measurements…
We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by…
Given a classical channel---a stochastic map from inputs to outputs---the input can often be transformed to an intermediate variable that is informationally smaller than the input. The new channel accurately simulates the original but at a…
The capacity of a quantum channel for transmission of classical information depends in principle on whether product states or entangled states are used at the input, and whether product or entangled measurements are used at the output. We…
The transmission of classical information over a classical channel gave rise to the classical capacity theorem with the optimal rate in terms of the classical mutual information. Despite classical information being a subset of quantum…
An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is…
The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we…
Classical communication capacity of a channel can be enhanced either through a device called a 'quantum switch' or by putting the channel in a quantum superposition. The gains in the two cases, although different, have their origin in the…
We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer…
The present paper is devoted to investigation of the classical capacity of infinite-dimensional quantum measurement channels. A number of usable conditions are introduced that enable us to apply previously obtained general results to…
The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and free classical bits of forward and…
As our main result we show that, in order to achieve the randomness assisted message - and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share…
We present an upper bound for the quantum channel capacity that is both additive and convex. Our bound can be interpreted as the capacity of a channel for high-fidelity quantum communication when assisted by a family of channels that have…