Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions

Abstract

We introduce two variants of the information spectrum relative entropy defined by Tomamichel and Hayashi which have the particular advantage of satisfying the data-processing inequality, i.e. monotonicity under quantum operations. This property allows us to obtain one-shot bounds for various information-processing tasks in terms of these quantities. Moreover, these relative entropies have a second order asymptotic expansion, which in turn yields tight second order asymptotics for optimal rates of these tasks in the i.i.d. setting. The tasks studied in this paper are fixed-length quantum source coding, noisy dense coding, entanglement concentration, pure-state entanglement dilution, and transmission of information through a classical-quantum channel. In the latter case, we retrieve the second order asymptotics obtained by Tomamichel and Tan. Our results also yield the known second order asymptotics of fixed-length classical source coding derived by Hayashi. The second order asymptotics of entanglement concentration and dilution provide a refinement of the inefficiency of these protocols - a quantity which, in the case of entanglement dilution, was studied by Harrow and Lo. We prove how the discrepancy between the optimal rates of these two processes in the second order implies the irreversibility of entanglement concentration established by Kumagai and Hayashi. In addition, the spectral divergence rates of the Information Spectrum Approach (ISA) can be retrieved from our relative entropies in the asymptotic limit. This enables us to directly obtain the more general results of the ISA from our one-shot bounds.

54 pages, 2 figures; v4: published version; v5: a few errors in intermediate results corrected, main results remain unchanged. These corrections have been published in [IEEE Transactions on Information Theory, vol. 63, no. 4, pp. 2625-2627, Apr. 2017], see https://doi.org/10.1109/TIT.2017.2661311. v6: Fixed an error in the second-order asymptotic expansion for noisy dense coding

References in corpus (4)

• Coding Theorem and Strong Converse for Quantum Channels
• Smooth Renyi Entropies and the Quantum Information Spectrum
• Quantum Achievability Proof via Collision Relative Entropy
• Quantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources

Cited by in corpus (33)

• Entropy accumulation with improved second-order term
• Strong converse rates for quantum communication
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• Non-asymptotic entanglement distillation
• Beyond the thermodynamic limit: finite-size corrections to state interconversion rates
• Position-based coding and convex splitting for private communication over quantum channels
• Quantum NETwork: from theory to practice
• Moderate deviation analysis for classical communication over quantum channels
• One-shot entanglement distillation beyond local operations and classical communication
• Decoding quantum information via the Petz recovery map
• Encoding classical information into quantum resources
• Entanglement-assisted private communication over quantum broadcast channels
• Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems
• Union bound for quantum information processing
• The variance of relative surprisal as single-shot quantifier
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Moderate deviation expansion for fully quantum tasks
• A solution of the generalised quantum Stein's lemma
• One-Shot Private Classical Capacity of Quantum Wiretap Channel: Based on one-shot quantum covering lemma
• Fidelity-Based Smooth Min-Relative Entropy: Properties and Applications
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Graph-associated entanglement cost of a multipartite state in exact and finite-block-length approximate constructions
• Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing
• Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction
• Entropic relations for indistinguishable quantum particles
• Repeater-Based Quantum Communication Protocol: Maximizing Teleportation Fidelity with Minimal Entanglement
• Second order asymptotics of visible mixed quantum source coding via universal codes
• A strong converse for the quantum state merging protocol
• Metrology-assisted entanglement distribution in noisy quantum networks
• On the Second-Order Asymptotics of the Partially Smoothed Conditional Min-Entropy & Application to Quantum Compression
• Towards the ultimate limits of quantum channel discrimination and quantum communication
• When quantum memory is useful for dense coding
• Tight relations and equivalences between smooth relative entropies