Related papers: Queue-Channel Capacities with Generalized Amplitud…
Any kind of quantum resource useful in different information processing tasks is vulnerable to several types of environmental noise. Here we study the behaviour of quantum correlations such as entanglement and steering in two-qubit systems…
Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise…
At the heart of building a large-scale quantum internet lies the challenge of establishing long-distance entanglement using quantum repeaters, which mitigate direct transmission losses but introduce additional noise in the nodes via…
The identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for…
We prove the equivalence of an arbitrary single-mode Gaussian quantum channel and a newly defined fiducial channel preceded by a phase shift and followed by a Gaussian unitary operation. This equivalence implies that the energy-constrained…
The additivity of the minimal output entropy and that of the $\chi$-capacity are known to be equivalent for finite-dimensional irreducibly covariant channels. In this paper we formulate a list of conditions allowing to establish similar…
We present analytic estimates of the performances of various approximate quantum error correction schemes for the generalized amplitude damping (GAD) qubit channel. Specifically, we consider both stabilizer and nonadditive quantum codes.…
We study classical capacities of quantum multi-access channels in geometric terms revealing breaking of additivity of Holevo-like capacity. This effect is purely quantum since, as one points out, any classical multi-access channels have…
We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…
We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking…
This paper provides new insight into the classical problem of determining both the capacity of the discrete-time channel with uniform output quantization and the capacity achieving input distribution. It builds on earlier work by Gallager…
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with $n$ messages,…
The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher…
Generalization is a central concept in machine learning theory, yet for quantum models, it is predominantly analyzed through uniform bounds that depend on a model's overall capacity rather than the specific function learned. These…
For a continuous-input-continuous-output arbitrarily distributed quantum channel carrying classical information, the channel capacity can be computed in terms of the distribution of the channel envelope, received signal strength over a…
$M$-ary signal transmission over AWGN channel with additive $Q$-ary interference where the sequence of i.i.d. interference symbols is known causally at the transmitter is considered. Shannon's theorem for channels with side information at…
The classical capacity of a quantum channel with arbitrary Markovian correlated noise is evaluated. For the general case of a channel with long-term memory, which corresponds to a Markov chain which does not converge to equilibrium, the…
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 consider transmission of stationary and ergodic sources over non-ergodic composite channels with channel state information at the receiver (CSIR). Previously we introduced alternate capacity definitions to Shannon capacity, including the…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…