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.
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.
We establish a fourth-resolvent-moment tensorisation inequality with sharp constant 3 for arbitrary positive-definite qubit averages and traceless Hermitian qubit signals, without restrictions on spectral contrast, commutativity, or signal orientation. The proof combines an exact Dirichlet covariance representation, positivity of mixed spectral coefficients, majorization-based association, and a nonnegative orientation covariance. The result extends fourth-order tensorisation beyond the structural classes addressed in our earlier work on sharp quantum information combining. It does not establish the full unrestricted Hirche–Reeb entropy conjecture, which requires additional control beyond the fourth resolvent moment. Duplicate for integration testing only. This is a byte-for-byte file copy of 10.5281/zenodo.23927232, not a new research result. Original publication is unchanged. NOETHER upload manifest: a5035f29-c39f-4580-8bcc-d8b3b3670f9a.
This computer-assisted preprint proves a sharp reverse relative entropy inequality L >= beta_m chi for uniform ensembles of individually normalized qubit states, for every m >= 2. Here chi is the Holevo quantity and L is the non-optimized quantum lautum information. The proof combines analytic Bloch-vector and Gram-matrix reductions with four interval certificates covering 855,780 boxes. For three matrices in arbitrary finite dimension, the paper also establishes local nonnegativity near faithful pairwise-commuting equality triples, allowing unequal traces and noncommuting perturbations. Further results include normalization bridges, an angular reduction for three qubits, and certified obstructions to proposed pinching and filtering descent arguments. The unrestricted unequal-trace ensemble inequality and the general equality of complete and ordinary modified logarithmic Sobolev constants are not proved. The accompanying archive contains sources, certificate inputs, verifiers, and reproduced results. Developed with AI assistance; not peer reviewed or formally verified. Companion paper: Christoph Hartmann, Reverse relative entropy and finite-time contraction for conditional expectations (2026).
This preprint proves reverse relative entropy and finite-time contraction inequalities for trace-preserving conditional expectations on finite-dimensional matrix algebras. A spectral-block reduction for an algebra-valued multiplier and a scalar boundary reduction yield explicit constants gamma_C and Lambda_p(C). Complete bounds follow from complete order bounds. For qubit depolarization, the results give 0.940046944825 <= alpha_c < 0.954706390024 in the convention exp(-2 alpha t), and 0.265671889879 < eta_c < 0.270961852526 at retained weight p=1/2. The contraction coefficient compares each state with its own conditional-expectation equilibrium. The paper also proves a stronger bound for commuting states, with sharpness in specified classes, and derives consequences for products of local channels. The exact complete qubit constants and the unrestricted sharp ensemble inequality are not determined here. The accompanying archive contains LaTeX sources, exact inputs, symbolic and interval verifiers, numerical regression checks, and reproduced outputs. Developed with AI assistance; not peer reviewed or formally verified. Companion paper: Christoph Hartmann, Sharp reverse entropy inequalities for uniform qubit ensembles (2026).
Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering, convex-splitting, position-based decoding, and one-shot communication protocols, yet they are often inherited from nonoptimal scalar estimates or from classical-to-quantum lifting arguments that introduce additional losses. In this work we show that the operator layer-cake representation provides a mechanism for lifting sharp scalar inequalities to the noncommutative setting without loss. Using an iterative Riemann--Stieltjes integration-by-parts method, we derive sharp quantum trace inequalities that tighten several standard single-shot bounds. For a logarithmic trace inequality recently introduced by Cheng \emph{et al.}\ and subsequently used in quantum covering and decoupling problems, we determine the exact optimal prefactor, replacing the previously known constant by a smaller Lambert-W constant and proving universal optimality for positive operators. We also completely characterize the threshold behavior that appears under normalization to quantum states. In addition, we establish optimal two-sided collision-divergence inequalities, which lead to improved position-based decoding and single-shot classical communication bounds. These results show that several finite-resource bounds in single-shot quantum information can be tightened, and that within the layer-cake Rényi-divergence framework the resulting constants are genuine optimality barriers rather than artifacts of the proof.
“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.
To probe a bipartite quantum system, one may use arbitrary global operators or restrict to product operators acting separately on the two subsystems. We determine the sharp universal comparison between the resulting norms. For every z∈Mn⊗Mm, we prove ∥z∥1≤2min{n,m}∥z∥ε, where ∥⋅∥1 is the trace norm and ∥⋅∥ε is the injective tensor norm associated with the trace norms on Mn and Mm. To prove the upper bound, we establish an L1 noncommutative Khintchine inequality whose random coefficients are the entries of a Haar unitary. We also show that the coefficient 2 is sharp. As applications, we show that the same sharp constant governs the gap between bipartite correlation measured in trace norm and that measured by a correlation function, and obtain an improved universal upper bound for quantum data hiding. The upper bound has also been formalized and machine-checked in Lean.