Sharp dimension-dependent continuity moduli for Petz and sandwiched optimized conditional Rényi entropies, attained by isotropic state pairs, for alpha in [1/2,1).
Coding Theorems of Quantum Information Theory
7 Pith papers cite this work, alongside 105 external citations. Polarity classification is still indexing.
7
Pith papers citing it
105
external citations · Pith
abstract
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.
citation-role summary
background 2
citation-polarity summary
roles
background 2representative citing papers
The authors prove the Burnashev-Holevo conjecture by deriving a finite-blocklength random coding bound with a dimension-independent prefactor for classical-quantum channels, using a new operator layer cake theorem.
Imposing exponentially small identification errors removes the superlinear message growth of deterministic identification and yields linear rates governed by the Minkowski dimension of the channel output set.
Simultaneous decoding for quantum multiple-access channels is achieved via pretty-good measurements on states augmented with weak message labels.
citing papers explorer
-
Sharp Continuity of Petz and Sandwiched R\'enyi Conditional Entropies
Sharp dimension-dependent continuity moduli for Petz and sandwiched optimized conditional Rényi entropies, attained by isotropic state pairs, for alpha in [1/2,1).
-
Error Exponents for Quantum Packing Problems via An Operator Layer Cake Theorem
The authors prove the Burnashev-Holevo conjecture by deriving a finite-blocklength random coding bound with a dimension-independent prefactor for classical-quantum channels, using a new operator layer cake theorem.
-
Rate-reliability tradeoff for deterministic identification
Imposing exponentially small identification errors removes the superlinear message growth of deterministic identification and yields linear rates governed by the Minkowski dimension of the channel output set.
-
Quantum simultaneous decoding via pretty-good measurements of tilted states
Simultaneous decoding for quantum multiple-access channels is achieved via pretty-good measurements on states augmented with weak message labels.
- Strong Converses for Quantum Channel Capacities from Blowing-Up Lemmata
- Arbitrarily Loss-Tolerant Quantum Position Verification in a Single Execution
- Spatial Localization of Relativistic Quantum Systems: The Commutativity Requirement and the Locality Principle. Part I: A General Analysis