Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication

DOI10.1007/s00220-016-2645-4zbMath1342.81065arXiv1408.3373OpenAlexW3100230369WikidataQ59832449 ScholiaQ59832449MaRDI QIDQ2630723

Mark M. Wilde, Milán Mosonyi, Tom Cooney

Publication date: 21 July 2016

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

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

Mathematics Subject Classification ID

Other types of codes (94B60) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum state estimation, approximate cloning (81P50) Quantum coding (general) (81P70)

Related Items

Data processing for the sandwiched Rényi divergence: a condition for equality ⋮ Swiveled Rényi entropies ⋮ On the second-order asymptotics for entanglement-assisted communication ⋮ Computation of sandwiched relative α-entropy of two n-mode Gaussian states ⋮ Strong converse exponent for classical-quantum channel coding ⋮ Rényi relative entropies of quantum Gaussian states ⋮ Temperature driven quenches in the Ising model: appearance of negative Rényi mutual information ⋮ Strong converse for the feedback-assisted classical capacity of entanglement-breaking channels ⋮ Generalized smooth mutual max-information of quantum channel ⋮ Memory effects displayed in the evolution of continuous variable system ⋮ Amortized channel divergence for asymptotic quantum channel discrimination ⋮ An entropy function of a quantum channel ⋮ Quantifying dynamical total coherence in a resource non-increasing framework ⋮ Geometric distinguishability measures limit quantum channel estimation and discrimination ⋮ Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents ⋮ Different quantum f-divergences and the reversibility of quantum operations ⋮ Preservation of a quantum Rényi relative entropy implies existence of a recovery map ⋮ Quantum channel discrimination without entanglement ⋮ Chain rules for quantum Rényi entropies ⋮ Rényi generalizations of the conditional quantum mutual information ⋮ Geometric Rényi divergence and its applications in quantum channel capacities ⋮ Optimized quantumf-divergences and data processing ⋮ Strong converse theorems using Rényi entropies ⋮ Sandwiched Rényi relative entropy on density operators ⋮ Correlation detection and an operational interpretation of the Rényi mutual information ⋮ Applications of position-based coding to classical communication over quantum channels ⋮ On distinguishability distillation and dilution exponents ⋮ Recoverability for optimized quantum f-divergences

Cites Work

• 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
• Multiplicativity of completely bounded \(p\)-norms implies a new additivity result
• A relation between completely bounded norms and conjugate channels
• Asymptotic error rates in quantum hypothesis testing
• A Minkowski type trace inequality and strong subadditivity of quantum entropy. II: Convexity and concavity
• Quasi-entropies for finite quantum systems
• Concavity of certain maps on positive definite matrices and applications to Hadamard products
• The proper formula for relative entropy and its asymptotics in quantum probability
• On the reliability function for a quantum communication channel.
• Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity
• Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies
• Second-order asymptotics for quantum hypothesis testing
• Convex trace functions and the Wigner-Yanase-Dyson conjecture
• Reliability function of general classical-quantum channel
• Strong converse and Stein's lemma in quantum hypothesis testing
• Strong Converse Rates for Quantum Communication
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• SECURITY OF QUANTUM KEY DISTRIBUTION
• Quantum Feedback Channels
• General formulas for capacity of classical-quantum channels
• On Error Exponents in Quantum Hypothesis Testing
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
• Hypothesis testing and information theory
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• The capacity of the quantum channel with general signal states
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• On entanglement-assisted classical capacity
• A Fully Quantum Asymptotic Equipartition Property
• Discrimination of Two Channels by Adaptive Methods and Its Application to Quantum System
• On the Quantum Rényi Relative Entropies and Related Capacity Formulas
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Sandwiched Rényi divergence satisfies data processing inequality
• Monotonicity of a relative Rényi entropy
• On quantum Rényi entropies: A new generalization and some properties
• Conditional expectation in an operator algebra. IV. Entropy and information
• Minimax Theorems