OctoInformBeta

OpenAI preprint, September 2026 · 4. From the thermal inequality to channel outputs · Section 4

Proposition 4.3: A lower bound for tensor powers of a generalized amplitude-damping channel, with arbitrary input entanglement

Output entropy from pure input populations.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Consider a pure state of nn qubits, possibly entangled, sent through nn uses of one fixed generalized amplitude-damping channel. The input data of interest are the excitation populations at the individual sites.

Write Fin⁡(m)={0,…,m−1}\operatorname{Fin}(m)=\{0,\ldots,m-1\}. The computational basis ℬn=Fin⁡(n)→Fin⁡(2)\mathcal B_n=\operatorname{Fin}(n)\to\operatorname{Fin}(2) consists of bit strings on the nn sites.✦ An nn-qubit operator is a complex matrix with rows and columns indexed by ℬn\mathcal B_n.✦

An amplitude vector ψ:ℬn→ℂ\psi:\mathcal B_n\to\mathbb C is normalized when its squared norm is one. For an amplitude vector ψ:ℬn→ℂ\psi:\mathcal B_n\to\mathbb C, the squared norm ∥ψ∥2\|\psi\|^2 is the sum in (1), and its associated pure state operator PψP_\psi is the matrix indexed by ℬn\mathcal B_n with entries given there: ∥ψ∥2=∑i∈ℬn|ψ(i)|2,Pψ(i,k)=ψ(i)ψ(k)¯.\|\psi\|^2=\sum_{i\in\mathcal B_n}|\psi(i)|^2, \qquad P_\psi(i,k)=\psi(i)\overline{\psi(k)}.(1) The excitation population pjp_j of an amplitude vector ψ:ℬn→ℂ\psi:\mathcal B_n\to\mathbb C at site j∈Fin⁡(n)j\in\operatorname{Fin}(n) is the sum of squared amplitudes on basis strings whose bit at jj is one, as in (2): pj=∑i∈ℬni(j)=1|ψ(i)|2.p_j=\sum_{\substack{i\in\mathcal B_n\\i(j)=1}}|\psi(i)|^2.(2)

For damping γ∈[0,1]\gamma\in[0,1] and stationary excited-state population ν∈[0,1]\nu\in[0,1], the single-qubit Kraus operators Kr(1)K^{(1)}_r, with r∈Fin⁡(4)r\in\operatorname{Fin}(4), are the matrices in (3): K0(1)=1−ν(1001−γ),K1(1)=γ(1−ν)(0100),K2(1)=ν(1−γ001),K3(1)=γν(0010).\begin{aligned} K^{(1)}_0&=\sqrt{1-\nu} \begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix}, &K^{(1)}_1&=\sqrt{\gamma(1-\nu)} \begin{pmatrix}0&1\\0&0\end{pmatrix},\\ K^{(1)}_2&=\sqrt{\nu} \begin{pmatrix}\sqrt{1-\gamma}&0\\0&1\end{pmatrix}, &K^{(1)}_3&=\sqrt{\gamma\nu} \begin{pmatrix}0&0\\1&0\end{pmatrix}. \end{aligned}(3)✦ The tensor product Kraus operator KrK_r for a label r:Fin⁡(n)→Fin⁡(4)r:\operatorname{Fin}(n)\to\operatorname{Fin}(4) is the nn-qubit operator with entries given in (4): Kr(i,k)=∏j∈Fin⁡(n)Kr(j)(1)(i(j),k(j)).K_r(i,k)=\prod_{j\in\operatorname{Fin}(n)} K^{(1)}_{r(j)}\bigl(i(j),k(j)\bigr).(4) The memoryless channel 𝒩γ,ν⊗n\mathcal N_{\gamma,\nu}^{\otimes n} is the map on nn-qubit operators defined by the Kraus sum in (5), where ** denotes the adjoint: 𝒩γ,ν⊗n(P)=∑r:Fin⁡(n)→Fin⁡(4)KrPKr*.\mathcal N_{\gamma,\nu}^{\otimes n}(P) =\sum_{r:\operatorname{Fin}(n)\to\operatorname{Fin}(4)}K_rPK_r^*.(5)

For a finite complex square matrix PP, the entropy S(P)S(P) is the real part of the trace of the spectral function x↦−xln⁡xx\mapsto-x\ln x applied to PP.✦ On density matrices its formula, together with the binary entropy hh on [0,1][0,1], is (6); both entropies are in nats, with 0ln⁡0=00\ln0=0: S(P)=−Tr⁡(Pln⁡P),h(q)=−qln⁡q−(1−q)ln⁡(1−q).S(P)=-\operatorname{Tr}(P\ln P), \qquad h(q)=-q\ln q-(1-q)\ln(1-q).(6) For an input excitation population p∈[0,1]p\in[0,1], the output determinant function v(γ,ν,p)v(\gamma,\nu,p) and the qubit entropy function g(u)g(u) are defined by (7): v(γ,ν,p)=γν(1−ν)+γ(1−γ)(p−ν)2,g(u)=h(1+1−4u2).\begin{aligned} v(\gamma,\nu,p) &=\gamma\nu(1-\nu)+\gamma(1-\gamma)(p-\nu)^2,\\ g(u)&=h\!\left(\frac{1+\sqrt{1-4u}}{2}\right). \end{aligned}(7)

The Claim

Theorem 1 (Pure output entropy bound). Let nn be a nonnegative integer and let γ,ν∈[0,1]\gamma,\nu\in[0,1]. For every normalized amplitude vector ψ:ℬn→ℂ\psi:\mathcal B_n\to\mathbb C with site populations pjp_j, the output entropy satisfies (8): ∑j∈Fin⁡(n)g(v(γ,ν,pj))≤S(𝒩γ,ν⊗n(Pψ)).\sum_{j\in\operatorname{Fin}(n)}g\bigl(v(\gamma,\nu,p_j)\bigr) \le S\!\left(\mathcal N_{\gamma,\nu}^{\otimes n}(P_\psi)\right).(8)✦

What Is Checked

The claim is stated over normalized complex amplitude vectors on ℬn\mathcal B_n, the channel in (5), and the input populations in (2).