Related papers: A strong converse for classical channel coding usi…
In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the ratio of their capacities. We establish that when coding…
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…
We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches, and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a…
The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have…
We consider quantum channels with one sender and two receivers, used in several different ways for the simultaneous transmission of independent messages. We begin by extending the technique of superposition coding to quantum channels with a…
The amount of information transmissible through a communications channel is determined by the noise characteristics of the channel and by the quantities of available transmission resources. In classical information theory, the amount of…
A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a…
Suppose that $m$ senders want to transmit classical information to $n$ receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among…
This paper explores communication over a two-sender, two-receiver classical interference channel, enhanced by the availability of entanglement resources between transmitters. The central contributions are an inner and outer bound on the…
In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's…
The information carrying capacity of the d-dimensional depolarizing channel is computed. It is shown that this capacity can be achieved by encoding messages as products of pure states belonging to an orthonormal basis of the state space,…
We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude…
We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…
A formula for the capacity of a quantum channel for transmitting private classical information is derived. This is shown to be equal to the capacity of the channel for generating a secret key, and neither capacity is enhanced by forward…
We consider the problem of trying to send a single classical bit through a noisy quantum channel when two transmissions through the channel are available as a resource. Classically, two transmissions add nothing to the receiver's capability…
We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's pre-shared ancilla. Instead of a pure state, we…
We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over…
This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn whether the legitimate parties are using the…
Several relations between the Holevo capacity and the entanglement-assisted classical capacity of a quantum channel are proved, necessary and sufficient conditions for their coincidence are obtained. In particular, it is shown that these…
The more than thirty years old issue of the (classical) information capacity of quantum communication channels was dramatically clarified during the last years, when a number of direct quantum coding theorems was discovered. The present…