Bounds on Information Combining With Quantum Side Information
arXiv:1706.09752 · doi:10.1109/TIT.2018.2842180
Abstract
"Bounds on information combining" are entropic inequalities that determine how the information (entropy) of a set of random variables can change when these are combined in certain prescribed ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory; entropy power inequalities are special instances of them. The arguably most elementary kind of information combining is the addition of two binary random variables (a CNOT gate), and the resulting quantities play an important role in Belief propagation and Polar coding. We investigate this problem in the setting where quantum side information is available, which has been recognized as a hard setting for entropy power inequalities. Our main technical result is a non-trivial, and close to optimal, lower bound on the combined entropy, which can be seen as an almost optimal "quantum Mrs. Gerber's Lemma". Our proof uses three main ingredients: (1) a new bound on the concavity of von Neumann entropy, which is tight in the regime of low pairwise state fidelities; (2) the quantitative improvement of strong subadditivity due to Fawzi-Renner, in which we manage to handle the minimization over recovery maps; (3) recent duality results on classical-quantum-channels due to Renes et al. We furthermore present conjectures on the optimal lower and upper bounds under quantum side information, supported by interesting analytical observations and strong numerical evidence. We finally apply our bounds to Polar coding for binary-input classical-quantum channels, and show the following three results: (A) Even non-stationary channels polarize under the polar transform. (B) The blocklength required to approach the symmetric capacity scales at most sub-exponentially in the gap to capacity. (C) Under the aforementioned lower bound conjecture, a blocklength polynomial in the gap suffices.
arXiv comment23 pages, 6 figures; v2: small corrections
References in corpus (30)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- On quantum Renyi entropies: a new generalization and some properties
- Distance measures to compare real and ideal quantum processes
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- Quantum Graphical Models and Belief Propagation
- Polar codes for classical-quantum channels
- Quantum Belief Propagation
- Sumset and inverse sumset theorems for Shannon entropy
- Tensor Networks and Quantum Error Correction
- Multivariate Trace Inequalities
- Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution
- Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map
- The entropy power inequality for quantum systems
- Universal bounds for the Holevo quantity, coherent information \\ and the Jensen-Shannon divergence
- Physical Underpinnings of Privacy
- Privacy Amplification, Private States, and the Uncertainty Principle
- A generalization of the Entropy Power Inequality to Bosonic Quantum Systems
- Polar codes for private and quantum communication over arbitrary channels
- Reliability function of general classical-quantum channel
- Relative Entropy Convergence for Depolarizing Channels
- The conditional entropy power inequality for Gaussian quantum states
- Entropy power inequalities for qudits
- Quantum polar codes for arbitrary channels
- Random Sampling of Quantum States: A Survey of Methods
- Polar codes in network quantum information theory
- Efficient Quantum Polar Codes Requiring No Preshared Entanglement
- Operational meaning of quantum measures of recovery
- On Dimension Bounds for Auxiliary Quantum Systems
- An improved rate region for the classical-quantum broadcast channel
- Bounds on the Concavity of Quantum Entropy
Cited by in corpus (5)
- On contraction coefficients, partial orders and approximation of capacities for quantum channels
- Convexity and Operational Interpretation of the Quantum Information Bottleneck Function
- Gaussian optimizers for entropic inequalities in quantum information
- The Entropy Power Inequality with quantum conditioning
- Rényi Bounds on Information Combining