The Setting
The computational basis of qubits is the set of bit strings , where .✦ An -qubit amplitude function is a function , and an -qubit operator is a complex matrix with rows and columns indexed by .✦
For a finite family of matrices and an input matrix , the Kraus operator sum is the matrix in (1), where denotes conjugate transpose: (1)✦ For damping and stationary excited-state population , the generalized amplitude-damping channel has the four Kraus operators in (2): (2)✦
The outer product of an amplitude function is the matrix with entries .✦ For input excitation population and phase label , the binary phase signal is the qubit vector defined in (3): (3)✦ For damping , stationary excited-state population , input excitation population and phase label , the phase output of the binary phase signal under the generalized amplitude-damping channel is the matrix in (4), with : (4)
For a finite complex square matrix , the von Neumann entropy is the real part of the trace of its spectral functional calculus for ; for a density matrix, .✦ The binary entropy and qubit entropy function are defined by (5), with ; the entropies are in nats: (5)✦ The scalar function is defined by (6): (6)✦
The Claim
Definition 1. For an amplitude function and a site , its excitation population is the real number in (7): (7)✦ For an -qubit operator and a site , its matrix excitation population is the real number in (8): (8)✦
Theorem 1. Let . For input excitation population and phase label , the phase output satisfies (9) and (10): (9)✦ (10)✦ The bounds on are (11) and (12): (11)✦ (12)✦
In the paper, the result reads: for , a pure qubit state with excitation probability has output determinant and output entropy , with ; for a block input, is the probability of outcome at site in the computational basis.
What Is Checked
The library defines populations for arbitrary -qubit amplitude functions and matrices, and states the phase-output identities for , allowing arbitrary real in the lower bound on .