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

DOI10.1088/1751-8113/40/28/S20MaRDI QIDQ5296091zbMATH OpenWikidataFDO

Authors Nilanjana Datta, Tony Dorlas

Publication date 1 August 2007

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0610049

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum computation (81P68) Coding theorems (Shannon theory) (94A24)

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.

Recommendations

• Entanglement assisted classical capacity of a class of quantum channels with long-term memory
• Coding theorem and strong converse for quantum channels
• Universal coding for classical-quantum channel
• Ergodic Classical-Quantum Channels: Structure and Coding Theorems
• Quantum coding theorems

Cited in

(11)

• Entanglement assisted classical capacity of a class of quantum channels with long-term memory
• Classical capacity of quantum channels with general Markovian correlated noise
• Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
• Universal coding for classical-quantum channel
• Hamiltonian models for quantum memory channels
• Applications of position-based coding to classical communication over quantum channels
• Quantum data locking for high-rate private communication
• CALCULATING A MAXIMIZER FOR QUANTUM MUTUAL INFORMATION
• Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
• Recovering quantum information through partial access to the environment
• Universal coding for transmission of private information

This page was built for publication: The coding theorem for a class of quantum channels with long-term memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5296091)