Coding Theorems for Compound Problems via Quantum Rényi Divergences

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Recently, a new notion of quantum Rényi divergences has been introduced by Müller-Lennert, Dupuis, Szehr, Fehr, and Tomamichel and Wilde, Winter, and Yang, which found a number of applications in strong converse theorems. Here, we show that these new Rényi divergences are also useful tools to obtain coding theorems in the direct domain of various problems. We demonstrate this by giving new and considerably simplified proofs for the achievability parts of Stein's lemma with composite null-hypothesis, universal state compression, and the classical capacity of compound classical-quantum channels, based on single-shot error bounds already available in the literature and simple properties of the quantum Rényi divergences. The novelty of our proofs is that the composite/compound coding theorems can be almost directly obtained from the single-shot error bounds, essentially with the same effort as for the case of simple null-hypothesis/single source/single channel.

Original languageEnglish
Article number7086060
Pages (from-to)2997-3012
Number of pages16
JournalIEEE Transactions on Information Theory
Volume61
Issue number6
DOIs
Publication statusPublished - Jun 1 2015

Fingerprint

divergence
coding
Composite materials
Compaction
literature

Keywords

  • channel capacity
  • Channel coding
  • information entropy
  • source coding

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Coding Theorems for Compound Problems via Quantum Rényi Divergences. / Mosonyi, M.

In: IEEE Transactions on Information Theory, Vol. 61, No. 6, 7086060, 01.06.2015, p. 2997-3012.

Research output: Contribution to journalArticle

@article{6447243d7d934eb59dd15a3384f87a54,
title = "Coding Theorems for Compound Problems via Quantum R{\'e}nyi Divergences",
abstract = "Recently, a new notion of quantum R{\'e}nyi divergences has been introduced by M{\"u}ller-Lennert, Dupuis, Szehr, Fehr, and Tomamichel and Wilde, Winter, and Yang, which found a number of applications in strong converse theorems. Here, we show that these new R{\'e}nyi divergences are also useful tools to obtain coding theorems in the direct domain of various problems. We demonstrate this by giving new and considerably simplified proofs for the achievability parts of Stein's lemma with composite null-hypothesis, universal state compression, and the classical capacity of compound classical-quantum channels, based on single-shot error bounds already available in the literature and simple properties of the quantum R{\'e}nyi divergences. The novelty of our proofs is that the composite/compound coding theorems can be almost directly obtained from the single-shot error bounds, essentially with the same effort as for the case of simple null-hypothesis/single source/single channel.",
keywords = "channel capacity, Channel coding, information entropy, source coding",
author = "M. Mosonyi",
year = "2015",
month = "6",
day = "1",
doi = "10.1109/TIT.2015.2417877",
language = "English",
volume = "61",
pages = "2997--3012",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Coding Theorems for Compound Problems via Quantum Rényi Divergences

AU - Mosonyi, M.

PY - 2015/6/1

Y1 - 2015/6/1

N2 - Recently, a new notion of quantum Rényi divergences has been introduced by Müller-Lennert, Dupuis, Szehr, Fehr, and Tomamichel and Wilde, Winter, and Yang, which found a number of applications in strong converse theorems. Here, we show that these new Rényi divergences are also useful tools to obtain coding theorems in the direct domain of various problems. We demonstrate this by giving new and considerably simplified proofs for the achievability parts of Stein's lemma with composite null-hypothesis, universal state compression, and the classical capacity of compound classical-quantum channels, based on single-shot error bounds already available in the literature and simple properties of the quantum Rényi divergences. The novelty of our proofs is that the composite/compound coding theorems can be almost directly obtained from the single-shot error bounds, essentially with the same effort as for the case of simple null-hypothesis/single source/single channel.

AB - Recently, a new notion of quantum Rényi divergences has been introduced by Müller-Lennert, Dupuis, Szehr, Fehr, and Tomamichel and Wilde, Winter, and Yang, which found a number of applications in strong converse theorems. Here, we show that these new Rényi divergences are also useful tools to obtain coding theorems in the direct domain of various problems. We demonstrate this by giving new and considerably simplified proofs for the achievability parts of Stein's lemma with composite null-hypothesis, universal state compression, and the classical capacity of compound classical-quantum channels, based on single-shot error bounds already available in the literature and simple properties of the quantum Rényi divergences. The novelty of our proofs is that the composite/compound coding theorems can be almost directly obtained from the single-shot error bounds, essentially with the same effort as for the case of simple null-hypothesis/single source/single channel.

KW - channel capacity

KW - Channel coding

KW - information entropy

KW - source coding

UR - http://www.scopus.com/inward/record.url?scp=84930225884&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930225884&partnerID=8YFLogxK

U2 - 10.1109/TIT.2015.2417877

DO - 10.1109/TIT.2015.2417877

M3 - Article

AN - SCOPUS:84930225884

VL - 61

SP - 2997

EP - 3012

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

M1 - 7086060

ER -