Quantum Channel Simulation and the Channel's Smooth Max-Information

Abstract

We study the general framework of quantum channel simulation, that is, the ability of a quantum channel to simulate another one using different classes of codes. First, we show that the minimum error of simulation and the one-shot quantum simulation cost under no-signalling assisted codes are given by semidefinite programs. Second, we introduce the channel's smooth max-information, which can be seen as a one-shot generalization of the mutual information of a quantum channel. We provide an exact operational interpretation of the channel's smooth max-information as the one-shot quantum simulation cost under no-signalling assisted codes, which significantly simplifies the study of channel simulation and provides insights and bounds for the case under entanglement-assisted codes. Third, we derive the asymptotic equipartition property of the channel's smooth max-information; i.e., it converges to the quantum mutual information of the channel in the independent and identically distributed asymptotic limit. This implies the quantum reverse Shannon theorem in the presence of no-signalling correlations. Finally, we explore the simulation cost of various quantum channels.

arXiv comment21 pages, 3 figures; close to published version

References in corpus (35)

• Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
• Min- and Max- Relative Entropies and a New Entanglement Monotone
• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• Post-selection technique for quantum channels with applications to quantum cryptography
• Transforming quantum operations: quantum supermaps
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Quantum Reverse Shannon Theorem
• The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Comparison of Quantum Channels by Superchannels
• Approaches for approximate additivity of the Holevo information of quantum channels
• Finite blocklength converse bounds for quantum channels
• Tema Con Variazioni: Quantum Channel Capacity
• Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
• Noisy channel coding via privacy amplification and information reconciliation
• Resource Theory of Coherence - Beyond States
• Using and reusing coherence to realize quantum processes
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• On the power of PPT-preserving and non-signalling codes
• Entanglement Cost of Quantum Channels
• Zero-error channel capacity and simulation assisted by non-local correlations
• Semidefinite programming strong converse bounds for classical capacity
• Distilling entanglement from arbitrary resources
• Cost of quantum entanglement simplified
• No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
• Smooth Max-Information as One-Shot Generalization for Mutual Information
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• One-shot entanglement-assisted quantum and classical communication
• A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via non-signalling codes
• Semidefinite programming converse bounds for quantum communication
• One-shot lossy quantum data compression
• Smooth Entropy Bounds on One-Shot Quantum State Redistribution
• On converse bounds for classical communication over quantum channels
• New one shot quantum protocols with application to communication complexity
• On the quantum no-signalling assisted zero-error classical simulation cost of non-commutative bipartite graphs

Cited by in corpus (37)

• Comparison of Quantum Channels by Superchannels
• No-Go Theorems for Quantum Resource Purification
• Application of the Resource Theory of Channels to Communication Scenarios
• Resource theory of asymmetric distinguishability for quantum channels
• Cost of quantum entanglement simplified
• Dynamical Entanglement
• Entanglement of a bipartite channel
• Fundamental limitations on distillation of quantum channel resources
• Physical Implementability of Linear Maps and Its Application in Error Mitigation
• Entropy of a quantum channel
• Quantum NETwork: from theory to practice
• No-go theorems for quantum resource purification II: new approach and channel theory
• Practical distributed quantum information processing with LOCCNet
• One-Shot Manipulation of Dynamical Quantum Resources
• Optimal quantum dataset for learning a unitary transformation
• The Communication Value of a Quantum Channel
• Quantum metrology in the finite-sample regime
• Thermodynamic Implementations of Quantum Processes
• Communication Cost of Quantum Processes
• Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
• Certifying the Classical Simulation Cost of a Quantum Channel
• Channel Simulation: Finite Blocklengths and Broadcast Channels
• Reliable Simulation of Quantum Channels: the Error Exponent
• Symmetry-Based Quantum Circuit Mapping
• Shadow Simulation of Quantum Processes
• Quantifying the performance of bidirectional quantum teleportation
• Projective robustness for quantum channels and measurements and their operational significance
• Postselected communication over quantum channels
• Quantum channel coding: Approximation algorithms and strong converse exponents
• Single-shot entanglement manipulation of states and channels revisited
• Towards the ultimate limits of quantum channel discrimination and quantum communication
• Thermodynamic criteria for signaling in quantum channels
• Uhlmann's theorem for measured divergences
• Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations
• Retrocausal capacity of a quantum channel: Communicating through noisy closed timelike curves
• Information storage and transmission under Markovian noise
• Tight relations and equivalences between smooth relative entropies