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

Datta, Nilanjana and Dorlas, T. C. (2007) The coding theorem for a class of quantum channels with long-term memory. Journal of Physics A: Mathematical and Theoretical, 40 (28). pp. 8147-8164. ISSN 1751-8113

Share :
Mastodon Twitter Facebook Email

[thumbnail of DIAS-STP-06-15.pdf]
Preview
Text
DIAS-STP-06-15.pdf

Download (170kB) | Preview
Official URL: http://doi.org/10.1088/1751-8113/40/28/S20

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].

Item Type: Article
Uncontrolled Keywords: quantum channels with long-term memory, classical ca- pacity, Feinstein’s Fundamental Lemma, Helstrom’s Theorem
Divisions: School of Theoretical Physics > Preprints
Date Deposited: 05 Oct 2017 19:31
Last Modified: 17 Dec 2022 14:06
URI: https://dair.dias.ie/id/eprint/180

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year