Let denote the damping strength and stationary excited-state population of a qubit. The generalized amplitude-damping channel sends an input excitation population to and multiplies coherence by . Write for the unrestricted Holevo information of a channel , in bits. Write for its unassisted classical capacity in bits per use, allowing arbitrary block input states and collective decoding with vanishing average error. Define the binary entropy in nats by for , with . Define for . For , set . The scalar objective is . The opposite-phase signal pair is .
The preprint records that the generalized channel’s one-use Holevo optimum had already been characterized. A one-use optimum alone does not exclude an increase in rate from entangled block signals.
The preprint proves an entropy lower bound for two-by-two block states built from rectangular matrix factors. It also establishes that the Holevo information of the generalized amplitude-damping channel tensored with any finite-dimensional quantum channel equals the sum of their Holevo informations, a conclusion not contained in the Lean library.
For every integer , under the parameter assumptions , the Lean library AmplitudeDamping proves . The scalar maximum is attained. The operational capacity satisfies . For every maximizing population , the equally weighted products of attain the Holevo optimum at every block length.
The results on these pages are those of the Lean library, each stated as the Lean library states it and linked to the Lean declaration behind it. Lean has checked every one of them, so the Lean library is the reference: where the preprint states a result differently, the statement on the page is the Lean library’s, and the preprint’s is given beside it. The preprint gives the results their order and their names.
AmplitudeDamping is a Lean library: 22 items, in six groups. Each has a page written by OctoInform, listed below.
No item matches.