Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
arXiv:2306.12416 · doi:10.1142/S0219749924400136
Abstract
We propose a quantum soft-covering problem for a given general quantum channel and one of its output states, which consists in finding the minimum rank of an input state needed to approximate the given channel output. We then prove a one-shot quantum covering lemma in terms of smooth min-entropies by leveraging decoupling techniques from quantum Shannon theory. This covering result is shown to be equivalent to a coding theorem for rate distortion under a posterior (reverse) channel distortion criterion by two of the present authors. Both one-shot results directly yield corollaries about the i.i.d. asymptotics, in terms of the coherent information of the channel. The power of our quantum covering lemma is demonstrated by two additional applications: first, we formulate a quantum channel resolvability problem, and provide one-shot as well as asymptotic upper and lower bounds. Secondly, we provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels, in particular separating for the first time the simultaneous identification capacity from the unrestricted one, proving a long-standing conjecture of the last author.
30 pages, 3 figures; v2 fixes an error in Definition 36 and various typos and minor issues throughout; v3 fixes some further minor points and provides a proof of Lemma 11 due to F. Dupuis, it is the version accepted by IJQI (special issue in honour of Alexander S. Holevo)
References in corpus (30)
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Aspects of generic entanglement
- A Fully Quantum Asymptotic Equipartition Property
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Coordination Capacity
- Distributed Channel Synthesis
- Quantum Reverse Shannon Theorem
- Second-order asymptotics for quantum hypothesis testing
- One-shot decoupling
- Relating quantum privacy and quantum coherence: an operational approach
- Chain Rules for Smooth Min- and Max-Entropies
- "Extrinsic" and "intrinsic" data in quantum measurements: asymptotic convex decomposition of positive operator valued measures
- Strong converse rates for quantum communication
- Quantum rate distortion, reverse Shannon theorems, and source-channel separation
- One-shot entanglement-assisted quantum and classical communication
- Quantum Achievability Proof via Collision Relative Entropy
- One-shot lossy quantum data compression
- Quantum rate distortion coding with auxiliary resources
- Compressibility of Mixed-State Signals
- Compression of quantum measurement operations
- Decoding quantum information via the Petz recovery map
- Quantum-to-classical rate distortion coding
- "Pretty strong" converse for the quantum capacity of degradable channels
- How much information can be obtained by a quantum measurement?
- Channel Simulation and Coded Source Compression
- Weak Decoupling Duality and Quantum Identification
- Quantum Rate-Distortion Coding of Relevant Information
- Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
- General Mixed State Quantum Data Compression with and without Entanglement Assistance
- Identification Via Quantum Channels