The quantum reverse Shannon theorem based on one-shot information theory

DOI10.1007/s00220-011-1309-7zbMath1236.94039arXiv0912.3805OpenAlexW3099674169WikidataQ59925595 ScholiaQ59925595MaRDI QIDQ717117

Renato Renner, Matthias Christandl, Mario Berta

Publication date: 27 September 2011

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

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

zbMATH Keywords

quantum channelone-shot quantum state mergingpost-selection techniquequantum reverse Shannon theoremshared entanglement

Mathematics Subject Classification ID

Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items

Semidefinite programming hierarchies for constrained bilinear optimization ⋮ On the second-order asymptotics for entanglement-assisted communication ⋮ Beyond islands: a free probabilistic approach ⋮ Generalized smooth mutual max-information of quantum channel ⋮ Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents ⋮ Asymptotic performance of port-based teleportation ⋮ One-shot decoupling ⋮ Decomposition rules for quantum Rényi mutual information with an application to information exclusion relations ⋮ Limits to catalysis in quantum thermodynamics ⋮ State transfer with quantum side information ⋮ Simple one-shot bounds for various source coding problems using smooth Rényi quantities ⋮ Identification via Quantum Channels ⋮ Multiplicativity of completely bounded \(p\)-norms implies a strong converse for entanglement-assisted capacity ⋮ Rényi generalizations of the conditional quantum mutual information ⋮ Faithful squashed entanglement ⋮ Thermodynamic implementations of quantum processes ⋮ Entanglement-assisted private communication over quantum broadcast channels ⋮ On composite quantum hypothesis testing ⋮ Exponential decay of correlations implies area law ⋮ Approximate quantum error correction revisited: introducing the alpha-bit ⋮ Strong converse theorems using Rényi entropies ⋮ Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications ⋮ Approximate tensorization of the relative entropy for noncommuting conditional expectations ⋮ de Finetti reductions for correlations ⋮ Computable lower bounds on the entanglement cost of quantum channels

Cites Work

• A Mathematical Theory of Communication
• Quantum state merging and negative information
• The transition probability in the state space of a \(^*\)-algebra
• The Quantum Reverse Shannon Theorem and Resource Tradeoffs for Simulating Quantum Channels
• Quantum computational networks
• Generalized relative entropies and the capacity of classical-quantum channels
• SECURITY OF QUANTUM KEY DISTRIBUTION
• The Private Classical Capacity and Quantum Capacity of a Quantum Channel
• The mother of all protocols: restructuring quantum information’s family tree
• MAX-RELATIVE ENTROPY OF ENTANGLEMENT, ALIAS LOG ROBUSTNESS
• Quantum computations: algorithms and error correction
• The capacity of the quantum channel with general signal states
• Fidelity for Mixed Quantum States
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
• Additivity of the classical capacity of entanglement-breaking quantum channels
• The Operational Meaning of Min- and Max-Entropy
• A Fully Quantum Asymptotic Equipartition Property
• Min- and Max-Relative Entropies and a New Entanglement Monotone
• The Quantum Capacity of Channels With Arbitrarily Correlated Noise
• Distilling entanglement from arbitrary resources
• One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys
• Noisy Channel Coding via Privacy Amplification and Information Reconciliation
• Leftover Hashing Against Quantum Side Information
• One-Shot Rates for Entanglement Manipulation Under Non-entangling Maps
• Duality Between Smooth Min- and Max-Entropies
• A sharp continuity estimate for the von Neumann entropy
• Noiseless coding of correlated information sources
• Theory of Cryptography
• Positive Functions on C ∗ -Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item