ﻻ يوجد ملخص باللغة العربية
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 chann
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
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,
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 re
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 a