Coding theorems for hybrid channels

DOI10.1137/S0040585X97986527MaRDI QIDQ2877883zbMATHOpenAlexFDO

Authors A. A. Kuznetsova, Alexander S. Holevo

Publication date 27 August 2014

Published in Theory of Probability and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.3255

zbMATH Keywords

communication channelentangled statecoding theoremclassical capacityhybrid (classical-quantum) probability system

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Quantum coherence, entanglement, quantum correlations (81P40) Channel models (including quantum) in information and communication theory (94A40)

Abstract: The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~cite{HCT}. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.

Recommendations

• Coding theorems for hybrid channels. II
• Quantum coding theorems
• Entanglement-Assisted Capacities of Constrained Quantum Channels
• On entanglement-assisted classical capacity
• scientific article; zbMATH DE number 1944611

Cited in

(7)

• Coding theorems for turbo code ensembles
• The information capacity of entanglement-assisted continuous variable quantum measurement
• Coding theorems for hybrid channels. II
• On the proof of the entanglement-assisted coding theorem for a quantum measurement channel
• Basic concepts and mathematical aspects in channel coding: multialternative rules
• scientific article; zbMATH DE number 3321830 (Why is no real title available?)
• A Unified Approach to Hybrid Coding

This page was built for publication: Coding theorems for hybrid channels

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