“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; and 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: 1) even non-stationary channels polarize under the polar transform; 2) the blocklength required to approach the symmetric capacity scales at most sub-exponentially in the gap to capacity; and 3) under the aforementioned lower bound conjecture, a blocklength polynomial in the gap suffices.
“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; and 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: 1) even non-stationary channels polarize under the polar transform; 2) the blocklength required to approach the symmetric capacity scales at most sub-exponentially in the gap to capacity; and 3) under the aforementioned lower bound conjecture, a blocklength polynomial in the gap suffices.
“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 ways. Such bounds play an important role in classical information theory, particularly in coding and Shannon theory. 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. 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; (2) the quantitative improvement of strong subadditivity due to Fawzi-Renner; (3) recent duality results due to Renes et al. We furthermore present conjectures on the optimal bounds under quantum side information, supported by analytical observations and strong numerical evidence. We finally apply our bounds to Polar coding for classical-quantum channels, and show that even non-stationary channels polarize, the blocklength required to approach the symmetric capacity scales at most sub-exponentially in the gap to capacity and under the lower bound conjecture a blocklength polynomial in the gap suffices.
Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.
This thesis addresses the interplay between asymptotic hypothesis testing and entropy inequalities in quantum information theory. In the first part of the thesis we focus on hypothesis testing. We consider two main settings; one can either fix quantum states while optimizing over measurements or fix a measurement and evaluate its capability to discriminate by optimizing over states. In the former setting, we prove a composite quantum Stein's Lemma. We also discuss how this gives an operational interpretation to several quantities of interest. For the latter, we give the optimal asymptotic error rates in several symmetric and asymmetric settings, and discuss properties and examples of these rates. In the second part, the focus is shifted to entropy inequalities. We start with recoverability inequalities. Using tools developed to prove the composite Stein's Lemma, we give a strengthened lower bound on the conditional quantum mutual information (CQMI). Next, we give an operational interpretation to the relative entropy of recovery via hypothesis testing. Then, we discuss some recent counterexamples, which show that the relative entropy of recovery is not a lower bound on the CQMI; we provide more counterexamples where some systems are classical. We then turn to a seemingly different type of entropy inequalities called bounds on information combining. Using a particular recoverability inequality, we give a lower bound and additionally conjecture optimal lower and upper bounds. Furthermore, we discuss implications of our bounds to the finite blocklength behavior of Polar codes. Finally, we discuss Renyi-2 entropy inequalities for Gaussian states, by exploiting their formulation as log-det inequalities to find recoverability related bounds on several quantities. We apply this to Gaussian steerability and entanglement measures, proving their monogamy and several other features.
We discuss the capacity of quantum channels for information transmission and storage. Quantum channels have dual uses: they can be used to transmit known quantum states which code for classical information, and they can be used in a purely quantum manner, for transmitting or storing quantum entanglement. We propose here a definition of the von Neumann capacity of quantum channels, which is a quantum-mechanical extension of the Shannon capacity and reverts to it in the classical limit. As such, the von Neumann capacity assumes the role of a classical or quantum capacity depending on the usage of the channel. In analogy to the classical construction, this capacity is defined as the maximum von Neumann mutual entropy processed by the channel, a measure which reduces to the capacity for classical information transmission through quantum channels (the ``Kholevo capacity'') when known quantum states are sent. The quantum mutual entropy fulfills all basic requirements for a measure of information, and observes quantum data-processing inequalities. We also derive a quantum Fano inequality relating the quantum loss of the channel to the fidelity of the quantum code. The quantities introduced are calculated explicitly for the quantum depolarizing channel. The von Neumann capacity is interpreted within the context of superdense coding, and an extended Hamming bound is derived that is consistent with that capacity.
Hirche and Reeb conjectured a sharp erasure-channel upper bound for the entropy of the XOR of independent uniform bits with arbitrary quantum side information. We establish this bound for a noncommuting class of binary classical–quantum ensembles: one average-state/signal pair admits an orthogonal decomposition into signed rank-one signal blocks, while the other acts on a qubit with an arbitrary traceless Hermitian signal. The principal analytic ingredient is a Schur-convexity theorem for symmetrized even-order qubit resolvent trace kernels. Combined with a positive-association principle for uniform Dirichlet vectors under majorization, this yields tensor-product resolvent-moment inequalities at every even order. A positive entropy-moment representation and Chebyshev association then establish the sharp conditional-entropy inequality. Additional corollaries cover two arbitrary-dimensional rank-one-block ensembles and gauge-balanced higher-rank signal blocks. The manuscript provides complete analytical proofs, including the simplex association and trace-kernel results, together with reproducible deterministic verification of the finite trace algebra and numerical tests on physically admissible noncommuting quantum ensembles. The results establish the sharp Hirche–Reeb information-combining inequality for the stated structural classes. The unrestricted conjecture for arbitrary quantum side information remains open.
Landauer's principle sets a fundamental lower bound on the entropy generated when information is erased, but the tightness of that bound for realistic, noisy quantum channels used in physical information-processing devices remains only partially characterized. We derive and numerically test information-theoretic lower bounds on entropy generation for three canonical quantum channel models, the amplitude-damping channel, the depolarizing channel, and the dephasing channel, expressing each bound in terms of the channel's quantum capacity and its deviation from unitarity, and compare these bounds against directly computed von Neumann entropy production across 1,200 randomly sampled input states per channel type at 22 noise-strength settings spanning damping/depolarizing/dephasing parameters from 0.02 to 0.90. Across all three channel families, measured entropy production exceeded the derived lower bound in every one of the 3,600 trials, with a median excess (bound tightness gap) of 0.087 bits and an interquartile range of 0.041 to 0.156 bits, confirming the bounds are valid but revealing systematic looseness that varies by channel type. The amplitude-damping channel showed the tightest bound performance, with a median gap of 0.052 bits at low-to-moderate damping strength (gamma < 0.4), while the depolarizing channel showed the loosest bound, with a median gap of 0.134 bits across the full noise range, a 2.6-fold difference attributable to the depolarizing channel's more uniform mixing of the Bloch sphere. Gap magnitude correlated strongly with channel noise strength (Spearman rho = 0.81, p < 0.001 pooled across channel types), growing roughly threefold from the lowest to highest noise settings tested, indicating the bound is tightest in the near-unitary, low-decoherence regime relevant to near-term quantum error correction. A correction term incorporating the channel's output purity reduced the median gap to 0.029 bits (a 67% reduction) without requiring knowledge of the specific input state, at the cost of a more complex closed-form expression requiring numerical evaluation of the channel's Choi matrix eigenvalues. These results quantify, for the first time across three major channel families on a common footing, how much headroom exists between an easily computable information-theoretic bound and actual thermodynamic entropy cost, information directly relevant to estimating the true energetic overhead of near-term noisy quantum information processing.