Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity

DOI10.1007/s00220-014-2212-9zbMath1308.81048arXiv1310.7028OpenAlexW2018785107WikidataQ59832466 ScholiaQ59832466MaRDI QIDQ2258018

Mark M. Wilde, Manish K. Gupta

Publication date: 2 March 2015

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

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

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40) Quantum coherence, entanglement, quantum correlations (81P40) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (21)

Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication ⋮ Multi-hop teleportation of an unknown qubit state based on W states ⋮ On the second-order asymptotics for entanglement-assisted communication ⋮ Relating different quantum generalizations of the conditional Rényi entropy ⋮ Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels ⋮ Rényi relative entropies of quantum Gaussian states ⋮ Temperature driven quenches in the Ising model: appearance of negative Rényi mutual information ⋮ Generalized smooth mutual max-information of quantum channel ⋮ Amortized channel divergence for asymptotic quantum channel discrimination ⋮ 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 ⋮ Capacity bounds via operator space methods ⋮ Rényi generalizations of the conditional quantum mutual information ⋮ Optimized quantumf-divergences and data processing ⋮ Capacity estimates via comparison with TRO channels ⋮ Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy ⋮ Strong converse theorems using Rényi entropies ⋮ Correlation detection and an operational interpretation of the Rényi mutual information ⋮ Relative entropy for von Neumann subalgebras ⋮ Investigating properties of a family of quantum Rényi divergences ⋮ Recoverability for optimized quantum f-divergences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• The quantum reverse Shannon theorem based on one-shot information theory
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
• On general minimax theorems
• 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
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Quantum hypothesis testing and the operational interpretation of the quantum Rényi relative entropies
• Convex trace functions and the Wigner-Yanase-Dyson conjecture
• Finite Blocklength Converse Bounds for Quantum Channels
• Catalytic Quantum Error Correction
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• Quantum Rate Distortion, Reverse Shannon Theorems, and Source-Channel Separation
• Correcting Quantum Errors with Entanglement
• Quantum Feedback Channels
• Quantum computations: algorithms and error correction
• Strong converse to the quantum channel coding theorem
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• On entanglement-assisted classical capacity
• Unconditional Security From Noisy Quantum Storage
• On the Quantum Rényi Relative Entropies and Related Capacity Formulas
• High Performance Entanglement-Assisted Quantum LDPC Codes Need Little Entanglement
• Entanglement-Assisted Quantum Turbo Codes
• “Pretty Strong” Converse for the Quantum Capacity of Degradable Channels
• A limit of the quantum Rényi divergence
• 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
• Simpler semidefinite programs for completely bounded norms
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• Quantum Information Theory

This page was built for publication: Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity