Add to ORKGThe maximal amount of information which is reliably transmitted over two uses of general Pauli channels with memory is proven to be achieved by maximally entangled states beyond some memory threshold. In particular, this proves a conjecture on the depolarizing channel by Macchiavello and Palma [Phys. Rev. A {\bf 65}, 050301(R) (2002)]. Below the memory threshold, for arbitrary Pauli channels, the two-use classical capacity is only achieved by a particular type of product states
Bennett et al. showed that allowing shared entanglement between a sender and receiver before communi...
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
We calculate the entanglement-assisted classical capacity of symmetric and asymmetric Pauli channels...
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the...
We investigate the problem of enhancement of mutual information by encoding classical data into enta...
We prove that a general upper bound on the maximal mutual information of quantum channels is saturat...
The sufficient condition of entanglement enhanced classical capacity is given for Pauli memory chann...
We prove that a general upper bound on the maximal mutual information of quantum channels is saturat...
We show that the amount of coherent quantum information that can be reliably transmitted down a deph...
In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channel...
We provide a model to study memory effects in quantum Gaussian channels with additive classical nois...
We show that the max-Rains information of a quantum channel is an efficiently computable, single-let...
Entangled inputs can enhance the capacity of quantum channels, this being one of the consequences of...
We give a capacity formula for the classical information transmission over a noisy quantum channel, ...
Bennett et al. showed that allowing shared entanglement between a sender and receiver before communi...
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...
We calculate the entanglement-assisted classical capacity of symmetric and asymmetric Pauli channels...
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the...
We investigate the problem of enhancement of mutual information by encoding classical data into enta...
We prove that a general upper bound on the maximal mutual information of quantum channels is saturat...
The sufficient condition of entanglement enhanced classical capacity is given for Pauli memory chann...
We prove that a general upper bound on the maximal mutual information of quantum channels is saturat...
We show that the amount of coherent quantum information that can be reliably transmitted down a deph...
In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channel...
We provide a model to study memory effects in quantum Gaussian channels with additive classical nois...
We show that the max-Rains information of a quantum channel is an efficiently computable, single-let...
Entangled inputs can enhance the capacity of quantum channels, this being one of the consequences of...
We give a capacity formula for the classical information transmission over a noisy quantum channel, ...
Bennett et al. showed that allowing shared entanglement between a sender and receiver before communi...
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender...
A strong converse theorem for the classical capacity of a quantum channel states that the probabilit...