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

References in corpus (5)

• Coding Theorem and Strong Converse for Quantum Channels
• Entanglement enhanced information transmission over a quantum channel with correlated noise
• Quantum Channels with Memory
• Quantum channels with a finite memory
• Classical capacity of quantum channels with general Markovian correlated noise

Cited by in corpus (39)

• Quantum channels and memory effects
• Memory effects in quantum channel discrimination
• One-shot entanglement-assisted quantum and classical communication
• A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
• Classical and quantum capacities of a fully correlated amplitude damping channel
• Enhancement of transmission rates in quantum memory channels with damping
• Capacities of lossy bosonic memory channels
• Entanglement transmission and generation under channel uncertainty: Universal quantum channel coding
• Applications of position-based coding to classical communication over quantum channels
• A Lossy Bosonic Quantum Channel with Non-Markovian Memory
• On Quantum Capacity of Compound Channels
• Coding theorems for compound problems via quantum Rényi divergences
• Many body physics and the capacity of quantum channels with memory
• Classical Capacities of Averaged and Compound Quantum Channels
• Classical capacity of quantum channels with general Markovian correlated noise
• Memory effects in attenuation and amplification quantum processes
• Recovering quantum information through partial access to the environment
• Renormalising entanglement distillation
• Classical capacity of a qubit depolarizing channel with memory
• Transmission of classical and quantum information through a quantum memory channel with damping
• Forgetfulness of continuous Markovian quantum channels
• Quantum data locking for high-rate private communication
• Quantum-enabled communication without a phase reference
• The classical capacity of quantum channels with memory
• Classical capacity of Gaussian thermal memory channels
• One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
• The invalidity of a strong capacity for a quantum channel with memory
• Entanglement-assisted capacities of compound quantum channels
• Universal coding for transmission of private information
• On the minimum output entropy of random orthogonal quantum channels
• Parrondo's paradox and superactivation of classical and quantum capacity of communication channels with memory
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding
• Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel
• Semiclassical model for a memory dephasing channel
• Suppressing correlated noise in signals transmitted over the Gaussian memory channels using $2N$-port splitter and phase flips
• 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
• The strong converse theorem for the product-state capacity of quantum channels with ergodic Markovian memory