Coding Theorem for a Class of Quantum Channels with Long-Term Memory

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 and a generalization of Helstrom's Theorem.

Some typos corrected

Cited by in corpus (12)

• Enhancement of transmission rates in quantum memory channels with damping
• A Lossy Bosonic Quantum Channel with Non-Markovian Memory
• On Quantum Capacity of Compound Channels
• Many body physics and the capacity of quantum channels with memory
• Classical Capacities of Averaged and Compound Quantum Channels
• Classical capacity of a qubit depolarizing channel with memory
• Forgetfulness of continuous Markovian quantum channels
• The classical capacity of quantum channels with memory
• Semiclassical model for a memory dephasing channel
• Entanglement Assisted Classical Capacity of a Class of Quantum Channels with Long-Term Memory
• Quantum Finite-Depth Memory Channels: Case Study
• Calculating a maximizer for quantum mutual information