Second-order asymptotics for the classical capacity of image-additive quantum channels

DOI10.1007/s00220-015-2382-0zbMath1318.81016arXiv1308.6503OpenAlexW3099232516WikidataQ60026393 ScholiaQ60026393MaRDI QIDQ2354350

Vincent Y. F. Tan, Marco Tomamichel

Publication date: 13 July 2015

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Related Items (11)

Second-order coding rates for pure-loss bosonic channels ⋮ Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d.—quantum lattice systems and more ⋮ On the second-order asymptotics for entanglement-assisted communication ⋮ Moderate deviation analysis for classical communication over quantum channels ⋮ Quantum information theory in infinite dimensions with application to optical channels ⋮ Ke Li's lemma for quantum hypothesis testing in general von Neumann algebras ⋮ Position-based coding and convex splitting for private communication over quantum channels ⋮ Entanglement-assisted private communication over quantum broadcast channels ⋮ Correlation detection and an operational interpretation of the Rényi mutual information ⋮ Union bound for quantum information processing ⋮ Applications of position-based coding to classical communication over quantum channels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• On general minimax theorems
• The Chernoff lower bound for symmetric quantum hypothesis testing
• The proper formula for relative entropy and its asymptotics in quantum probability
• Randomizing quantum states: constructions and applications
• Second-order asymptotics for quantum hypothesis testing
• Strong converse and Stein's lemma in quantum hypothesis testing
• GENERALIZED ENTROPIES
• Efficient Approximation of Quantum Channel Capacities
• Quantum Channels With Polytopic Images and Image Additivity
• Finite Blocklength Converse Bounds for Quantum Channels
• A Decoupling Approach to Classical Data Transmission Over Quantum Channels
• Continuity bounds on the quantum relative entropy
• General formulas for capacity of classical-quantum channels
• Approximation theory of output statistics
• The capacity of the quantum channel with general signal states
• Operational capacity and pseudoclassicality of a quantum channel
• Coding theorem and strong converse for quantum channels
• Strong converse to the quantum channel coding theorem
• The method of types [information theory]
• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation
• Channel Coding Rate in the Finite Blocklength Regime
• A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels
• A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• On quantum Rényi entropies: A new generalization and some properties
• A simple derivation of the coding theorem and some applications
• Conditional expectation in an operator algebra. IV. Entropy and information
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)

This page was built for publication: Second-order asymptotics for the classical capacity of image-additive quantum channels