Quantum Capacity of a dephasing channel with memory

We show that the amount of coherent quantum information that can be reliably transmitted down a dephasing channel with memory is maximized by separable input states. In particular, we model the channel as a Markov chain or a multimode environment of oscillators. While in the first model the maximization is achieved for the maximally mixed input state, in the latter it is convenient to exploit the presence of a decoherence-protected subspace generated by memory effects. We explicitly compute the quantum channel capacity for the first model while numerical simulations suggest a lower bound for the latter. In both cases memory effects enhance the coherent information. We present results valid for arbitrary size of the input.Comment: Revised version, to be published in New Journal of Physic

Secrecy Results for Compound Wiretap Channels

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and the maximum error probability criterion, and with a decoder that is robust against the effect of randomisation in the encoding. This relieves us from the need of decoding the randomisation parameter which is in general not possible within this model. Moreover we prove a lower bound on the secrecy capacity of the compound wiretap channel without channel state information and derive a multi-letter expression for the capacity in this communication scenario