Journal Article


T. C. Dorlas
Nilanjana Datta



markov chain combinations theorem class quantum long memory transmission

The coding theorem for a class of quantum channels with long-term memory (2007)

Abstract In this paper we consider the transmission of classical information through a class of quantum channels with long-term memory, which are given by convex combinations of product channels. Hence, the memory of such channels is given by a Markov chain which is aperiodic but not irreducible. We prove the coding theorem and weak converse for this class of channels. The main techniques that we employ, are a quantum version of Feinstein’s Fundamental Lemma [6, 11] and a generalization of Helstrom’s Theorem. [8].
Collections Ireland -> DAIR -> Type = Article
Ireland -> DAIR -> Status = Published

Full list of authors on original publication

T. C. Dorlas, Nilanjana Datta

Experts in our system

T. C. Dorlas
Total Publications: 44