Related papers: General formulas for capacity of classical-quantum…
We consider two kind of energy constraints when the output state is a coherent state. One is a constraint on the total energy during a fixed period; the other is a constraint on the total energy for a single code. The first setting can be…
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…
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 introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for…
We exhibit discrete memoryless quantum channels whose quantum capacity assisted by two-way classical communication, $Q_2$, exceeds their unassisted one-shot Holevo capacity $C_H$. These channels may be thought of as having a data input and…
A direct proof of the relation between the one-shot classical capacity and the minimal output entropy for covariant quantum channels is suggested. The structure of covariant channels is described in some detail. A simple proof of a general…
Optimization methods aimed at estimating the capacities of a general Gaussian channel are developed. Specifically evaluation of classical capacity as maximum of the Holevo information is pursued over all possible Gaussian encodings for the…
We present a general model for quantum channels with memory, and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t' > t can be…
In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme.…
Recently there has been considerable activity on the subject of additivity of various quantum channel capacities. Here, we construct a family of channels with sharply bounded classical, hence private capacity. On the other hand, their…
Compound channel models offer a simple and straightforward way of analyzing the stability of decoder design under model variations. With this work we provide a coding theorem for a large class of practically relevant compound channel…
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…
We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the…
We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…
The quantum channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known.…
Prior entanglement between sender and receiver, which exactly doubles the classical capacity of a noiseless quantum channel, can increase the classical capacity of some noisy quantum channels by an arbitrarily large constant factor…
The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using…
We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…
A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of…
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…