Related papers: Second-Order Asymptotics for the Classical Capacit…
We consider a nontrivial class of infinite dimensional quantum channels characterized by finiteness of the Holevo capacity. Some general properties of channels of this class are described. In particular, a special sufficient condition of…
We obtain continuity bounds for basic information characteristics of quantum channels depending on their input dimension (if it is finite) and on the input energy bound (if the input dimension is infinite). We pay a special attention to the…
We present an algorithm for calculation of the Gaussian classical capacity of a quantum bosonic memory channel with additive Gaussian noise. The algorithm, restricted to Gaussian input states, is applicable to all channels with noise…
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…
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…
Quantum memories can be regarded as quantum channels that transmit information through time without moving it through space. Aiming at a reliable storage of information we may thus not only encode at the beginning and decode at the end, but…
We study information transmission over a fully correlated amplitude damping channel acting on two qubits. We derive the single-shot classical channel capacity and show that entanglement is needed to achieve the channel best performance. We…
We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the…
We present a new decoding protocol to realize transmission of classical information through a quantum channel at asymptotically maximum capacity, achieving the Holevo bound and thus the optimal communication rate. At variance with previous…
We investigate practical finite-blocklength classical-quantum channel coding over the quantum amplitude damping channel (ADC), aiming to transmit classical information reliably through quantum outputs. Our findings indicate that for any…
Capacities of quantum channels are fundamental quantities in the theory of quantum information. A desirable property is the additivity for a capacity. However, this cannot be achieved for a few quantities that have been established as…
A quantum communication channel can be put to many uses: it can transmit classical information, private classical information, or quantum information. It can be used alone, with shared entanglement, or together with other channels. For each…
This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an…
We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff…
We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity…
Quantum communications using continuous variables are quite mature experimental techniques and the relevant theories have been extensively investigated with various methods. In this paper, we study the continuous variable quantum channels…
We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. Therefore we extend the…
Consider communication over a channel whose probabilistic model is completely unknown vector-wise and is not assumed to be stationary. Communication over such channels is challenging because knowing the past does not indicate anything about…
The Quantum Reverse Shannon Theorem has been a milestone in quantum information theory. It states that asymptotically reliable simulation of a quantum channel, assisted by unlimited shared entanglement, requires a rate of classical…
We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of key results known from bipartite channels to that of multiparty scenario. In particular, we introduce multiparty versions of…