The Setting
A rectangular matrix with one zero block gives an unnormalized quantum state through its Gram matrix. The entropy question compares that state with the three occupied blocks, retaining the squared Hilbert-Schmidt mass of each block.
Let , , and , where all dimensions are finite. The matrix with one zero block is in (1): (1)✦ For a complex rectangular matrix , its Gram matrix is , where is the conjugate transpose✦, and its mass is the squared Hilbert-Schmidt mass defined in (2): (2)✦
For a finite complex square matrix , its von Neumann entropy is the real part of the trace of the spectral function associated with , with . For positive semidefinite , it is given by (3), without a unit trace requirement. (3) The binary entropy for and the qubit entropy at determinant are the functions in (4); all entropies here are in nats. (4)✦
For nonnegative masses , the larger and smaller block eigenvalues and are the scalars in (5): (5) For real , the scalar entropy deficit is the real function defined in (6), with and : (6)
The Claim
Theorem 1. Let be complex matrices of the respective block dimensions in (1), each of mass one. For nonnegative real weights with , the normalized entropy bound is (7): (7)✦ For arbitrary complex blocks of those dimensions, with masses as in (2), the entropy deficit satisfies (8): (8)✦
In the paper, the result reads: for complex matrices with masses satisfying , the bound (9) holds, with every zero-weight term omitted and : (9)
What Is Checked
Both claims are stated over finite complex rectangular matrices with the compatible block dimensions in (1); (7) additionally assumes unit block masses and nonnegative weights summing to one.