One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
arXiv:2004.12593 · doi:10.1109/TIT.2022.3222775
Abstract
We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity region, represented by the smooth conditional entropies and the error tolerance. The proof is based on the randomized partial decoupling theorem, which is a generalization of the decoupling theorem. The two bounds match in the asymptotic limit of infinitely many uses of a memoryless channel and coincide with the previous result obtained by Hsieh and Wilde. Direct and converse bounds for various communication tasks are obtained as corollaries, both for the one-shot and asymptotic scenarios.
References in corpus (43)
- The capacity of the noisy quantum channel
- On the quantum, classical and total amount of correlations in a quantum state
- Entanglement-Assisted Classical Capacity of Noisy Quantum Channels
- Coding Theorem and Strong Converse for Quantum Channels
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- A Fully Quantum Asymptotic Equipartition Property
- Quantum state merging and negative information
- The mother of all protocols: Restructuring quantum information's family tree
- Continuity of quantum conditional information
- Duality Between Smooth Min- and Max-Entropies
- A Resource Framework for Quantum Shannon Theory
- The quantum capacity of channels with arbitrarily correlated noise
- Strong Converse to the Quantum Channel Coding Theorem
- A decoupling approach to the quantum capacity
- Converse bounds for private communication over quantum channels
- One-shot decoupling
- A family of quantum protocols
- Classical data compression with quantum side information
- Entanglement-assisted communication of classical and quantum information
- Finite blocklength converse bounds for quantum channels
- Noisy channel coding via privacy amplification and information reconciliation
- One shot entanglement assisted classical and quantum communication over noisy quantum channels: A hypothesis testing and convex split approach
- Quantum message compression with applications
- Quantum Coding with Finite Resources
- Generalized relative entropies and the capacity of classical-quantum channels
- The apex of the family tree of protocols: Optimal rates and resource inequalities
- On the Second-Order Asymptotics for Entanglement-Assisted Communication
- One-shot entanglement-assisted quantum and classical communication
- A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
- Position-based coding and convex splitting for private communication over quantum channels
- Catalytic Decoupling of Quantum Information
- Applications of position-based coding to classical communication over quantum channels
- Covert Capacity of Bosonic Channels
- Superadditivity of the Classical Capacity with Limited Entanglement Assistance
- A decoupling approach to classical data transmission over quantum channels
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- On the near-optimality of one-shot classical communication over quantum channels
- One-shot quantum error correction of classical and quantum information
- Efficient methods for one-shot quantum communication
- One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
- One-Shot Randomized and Nonrandomized Partial Decoupling
- One-Shot Hybrid State Redistribution