Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Audenaert’s binary Holevo bound

Abstract

Binary Holevo information in bits is at most half the trace norm of the difference.

Theorem 1.1 (The binary ensemble inequality).

Proof. Machine-checked in Lean as D5/S3/Divergence/AudenaertBinaryHolevoBound.binaryHolevoBound (✓ std3). ∎

Citation. Koenraad M. R. Audenaert (2014). Quantum Skew Divergence. DOI: 10.1063/1.4901039. URL: https://arxiv.org/abs/1304.5935v2.

Commentary.

Audenaert, Quantum Skew Divergence, Theorem 14, bounds Holevo information by the classical mixing entropy times the maximal trace distance. For an equiprobable binary ensemble the mixing entropy is one bit. The matrices may be singular. The matrix-log resolvent integral gives the derivative along a positive affine path. Positivity of that derivative and its trace pairing bound the skew divergence by trace distance times the negative logarithm of the mixing weight. Specializing the weight to one half gives the binary inequality for strictly positive states. Adding epsilon times the identity and dividing by one plus n epsilon preserves trace one, and continuity of x log x extends the estimate to singular states.

References