The Setting
Consider a pure state of qubits, possibly entangled, sent through uses of one fixed generalized amplitude-damping channel. The input data of interest are the excitation populations at the individual sites.
Write . The computational basis consists of bit strings on the sites.✦ An -qubit operator is a complex matrix with rows and columns indexed by .✦
An amplitude vector is normalized when its squared norm is one. For an amplitude vector , the squared norm is the sum in (1), and its associated pure state operator is the matrix indexed by with entries given there: (1) The excitation population of an amplitude vector at site is the sum of squared amplitudes on basis strings whose bit at is one, as in (2): (2)
For damping and stationary excited-state population , the single-qubit Kraus operators , with , are the matrices in (3): (3)✦ The tensor product Kraus operator for a label is the -qubit operator with entries given in (4): (4) The memoryless channel is the map on -qubit operators defined by the Kraus sum in (5), where denotes the adjoint: (5)
For a finite complex square matrix , the entropy is the real part of the trace of the spectral function applied to .✦ On density matrices its formula, together with the binary entropy on , is (6); both entropies are in nats, with : (6) For an input excitation population , the output determinant function and the qubit entropy function are defined by (7): (7)
The Claim
Theorem 1 (Pure output entropy bound). Let be a nonnegative integer and let . For every normalized amplitude vector with site populations , the output entropy satisfies (8): (8)✦
What Is Checked
The claim is stated over normalized complex amplitude vectors on , the channel in (5), and the input populations in (2).