Related papers: Classical-Quantum Arbitrarily Varying Wiretap Chan…
The set of Multi-level Amplitude Damping (MAD) quantum channels is introduced as a generalization of the standard qubit Amplitude Damping Channel to quantum systems of finite dimension $d$. In the special case of $d=3$, by exploiting…
We find a tight upper bound for the classical capacity of quantum thermal noise channels that is within $1/\ln 2$ bits of Holevo's lower bound. This lower bound is achievable using unentangled, classical signal states, namely displaced…
Determining the ultimate classical information carrying capacity of electromagnetic waves requires quantum-mechanical analysis to properly account for the bosonic nature of these waves. Recent work has established capacity theorems for…
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region is comprised of the rates at which it…
We prove that a broad array of capacities of a quantum channel are continuous. That is, two channels that are close with respect to the diamond norm have correspondingly similar communication capabilities. We first show that the classical…
We study mixed unitary quantum channels generated by irreducible projective unitary representations of finite groups. Under some assumptions on the probability distribution determining a mixture the classical capacity of the channel is…
We study commitment scheme for classical-quantum channels. To accomplish this we define various notions of commitment capacity for these channels and prove matching upper and lower bound on it in terms of the conditional entropy. Our…
The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel,…
A quantum channel physically is a unitary interaction between the information carrying system and an environment, which is initialized in a pure state before the interaction. Conventionally, this state, as also the parameters of the…
We present a simple model of quantum communication where a noisy quantum channel may benefit from the addition of further noise at the decoding stage. We demonstrate enhancement of the classical information capacity of an amplitude damping…
The guesswork of a classical-quantum channel quantifies the cost incurred in guessing the state transmitted by the channel when only one state can be queried at a time, maximized over any classical pre-processing and minimized over any…
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…
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…
Classical feedback is defined here as the knowledge by the transmitter of the quantum state of the qubit received by the receiver. Such classical feedback doubles capacities of certain memoryless quantum channels without preexisting…
We derive the general formula for the capacity of a noiseless quantum channel assisted by an arbitrary amount of noisy entanglement. In this capacity formula, the ratio of the quantum mutual information and the von Neumann entropy of the…
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…
We consider the scenario of classical communication over a finite-dimensional quantum channel with memory using a separable-state input ensemble and local output measurements. We propose algorithms for estimating the information rate of…
In this work the arbitrarily varying wiretap channel AVWC is studied. We derive a lower bound on the random code secrecy capacity for the average error criterion and the strong secrecy criterion in the case of a best channel to the…
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.…
We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing…