No Arabic abstract
Losses in quantum communication lines severely affect the rates of reliable information transmission and are usually considered to be state-independent. However, the loss probability does depend on the system state in general, with the polarization dependent losses being a prominent example. Here we analyze biased trace decreasing quantum operations that assign different loss probabilities to states and introduce the concept of a generalized erasure channel. We find lower and upper bounds for the classical and quantum capacities of the generalized erasure channel as well as characterize its degradability and antidegradability. We reveal superadditivity of coherent information in the case of the polarization dependent losses, with the difference between the two-letter quantum capacity and the single-letter quantum capacity exceeding $7.197 cdot 10^{-3}$ bit per qubit sent, the greatest value among qubit-input channels reported so far.
We present an experimental approach to construct a dephrasure channel, which contains both dephasing and erasure noises, and can be used as an efficient tool to study the superadditivity of coherent information. By using a three-fold dephrasure channel, the superadditivity of coherent information is observed, and a substantial gap is found between the zero single-letter coherent information and zero quantum capacity. Particularly, we find that when the coherent information of n channel uses is zero, in the case of larger number of channel uses, it will become positive. These phenomena exhibit a more obvious superadditivity of coherent information than previous works, and demonstrate a higher threshold for non-zero quantum capacity. Such novel channels built in our experiment also can provide a useful platform to study the non-additive properties of coherent information and quantum channel capacity.
Trace decreasing quantum operations naturally emerge in experiments involving postselection. However, the experiments usually focus on dynamics of the conditional output states as if the dynamics were trace preserving. Here we show that this approach leads to incorrect conclusions about the dynamics divisibility, namely, one can observe an increase in the trace distance or the system-ancilla entanglement although the trace decreasing dynamics is completely positive divisible. We propose solutions to that problem and introduce proper indicators of the information backflow and the indivisibility. We also review a recently introduced concept of the generalized erasure dynamics that includes more experimental data in the dynamics description. The ideas are illustrated by explicit physical examples of polarization dependent losses.
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 specific models, in particular, to the multi-mode bosonic Gaussian measurement channels. An explicit formula for the classical capacity of the Gaussian measurement channel is obtained in this paper without assuming the global gauge symmetry, solely under certain threshold condition. The result is illustrated by the capacity computation for one-mode squeezed-noise heterodyne measurement channel.
Coherent information quantifies the achievable rate of the reliable quantum information transmission through a communication channel. Use of the correlated quantum states (multiletter codes) instead of the factorized ones (single-letter codes) may result in an increase in the achievable rate, a phenomenon known as the coherent-information superadditivity. However, even for simple physical models of channels it is rather difficult to detect the superadditivity and find the advantageous multiletter codes. Here we consider the case of polarization dependent losses and propose some physically motivated multiletter codes which outperform all single-letter ones in a wide range of the channel parameters. We show that in the asymptotic limit of the infinite code length the superadditivity phenomenon takes place whenever the communication channel is neither degradable nor antidegradable. Besides the superadditivity identification, we also provide a method how to modify the proposed codes and get a higher quantum communication rate by doubling the code length. The obtained results give a deeper understanding of useful multiletter codes and may serve as a benchmark for quantum capacity estimations and future approaches toward an optimal strategy to transfer quantum information.
We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some possible applications of our result. We also show that our scheme allows a reasonable distribution of channel capacity over two senders.