One-Shot Triple-Resource Trade-Off in Quantum Channel Coding

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 (10)

• On the quantum, classical and total amount of correlations in a quantum state
• Coding Theorem and Strong Converse for Quantum Channels
• The mother of all protocols: Restructuring quantum information's family tree
• Generalized relative entropies and the capacity of classical-quantum channels
• Covert Capacity of Bosonic 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

Cited by in corpus (4)

• Non-Clifford Cost of Random Unitaries
• Decoding general error correcting codes and the role of complementarity
• On Computational Complexity of Unitary and State Design Properties
• Explicit decoders using fixed-point amplitude amplification based on QSVT