OctoInformBeta

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

Populations and one-site output entropy: Computational-basis populations and the determinant bounds for a damped qubit phase pair

Site populations and phase output entropy.

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

The computational basis of nn qubits is the set ℬn\mathcal B_n of bit strings x:Fin⁡(n)→Fin⁡(2)x:\operatorname{Fin}(n)\to\operatorname{Fin}(2), where Fin⁡(m)={0,…,m−1}\operatorname{Fin}(m)=\{0,\ldots,m-1\}.✦ An nn-qubit amplitude function is a function ψ:ℬn→ℂ\psi:\mathcal B_n\to\mathbb C, and an nn-qubit operator PP is a complex matrix with rows and columns indexed by ℬn\mathcal B_n.✦

For a finite family of matrices Lr:ℂd→ℂeL_r:\mathbb C^d\to\mathbb C^e and an input matrix P∈ℂd×dP\in\mathbb C^{d\times d}, the Kraus operator sum ℰL(P)\mathcal E_L(P) is the matrix in (1), where ** denotes conjugate transpose: ℰL(P)=∑rLrPLr*.\mathcal E_L(P)=\sum_r L_r P L_r^*.(1)✦ For damping γ∈[0,1]\gamma\in[0,1] and stationary excited-state population ν∈[0,1]\nu\in[0,1], the generalized amplitude-damping channel has the four Kraus operators in (2): K0=1−ν(1001−γ),K1=γ(1−ν)(0100),K2=ν(1−γ001),K3=γν(0010).\begin{aligned} K_0&=\sqrt{1-\nu} \begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix},& K_1&=\sqrt{\gamma(1-\nu)} \begin{pmatrix}0&1\\0&0\end{pmatrix},\\ K_2&=\sqrt{\nu} \begin{pmatrix}\sqrt{1-\gamma}&0\\0&1\end{pmatrix},& K_3&=\sqrt{\gamma\nu} \begin{pmatrix}0&0\\1&0\end{pmatrix}. \end{aligned}(2)✦

The outer product |ψ⟩⟨ψ||\psi\rangle\langle\psi| of an amplitude function ψ\psi is the matrix with entries ψ(x)ψ(y)¯\psi(x)\overline{\psi(y)}.✦ For input excitation population p∈[0,1]p\in[0,1] and phase label s∈Fin⁡(2)s\in\operatorname{Fin}(2), the binary phase signal |ap,s⟩|a_{p,s}\rangle is the qubit vector defined in (3): |ap,s⟩=1−p|0⟩+(−1)sp|1⟩.|a_{p,s}\rangle=\sqrt{1-p}\,|0\rangle+(-1)^s\sqrt p\,|1\rangle.(3)✦ For damping γ∈[0,1]\gamma\in[0,1], stationary excited-state population ν∈[0,1]\nu\in[0,1], input excitation population p∈[0,1]p\in[0,1] and phase label s∈Fin⁡(2)s\in\operatorname{Fin}(2), the phase output ρs\rho_s of the binary phase signal |ap,s⟩|a_{p,s}\rangle under the generalized amplitude-damping channel is the matrix in (4), with K=(K0,K1,K2,K3)K=(K_0,K_1,K_2,K_3): ρs=ℰK(|ap,s⟩⟨ap,s|).\rho_s=\mathcal E_K\bigl(|a_{p,s}\rangle\langle a_{p,s}|\bigr).(4)

For a finite complex square matrix PP, the von Neumann entropy S(P)S(P) is the real part of the trace of its spectral functional calculus for t↦−tln⁡tt\mapsto-t\ln t; for a density matrix, S(P)=−Tr⁡(Pln⁡P)S(P)=-\operatorname{Tr}(P\ln P).✦ The binary entropy h(q)h(q) and qubit entropy function g(u)g(u) are defined by (5), with 0ln⁡0=00\ln0=0; the entropies are in nats: h(q)=−qln⁡q−(1−q)ln⁡(1−q),g(u)=h(1+1−4u2).h(q)=-q\ln q-(1-q)\ln(1-q), \qquad g(u)=h\!\left(\frac{1+\sqrt{1-4u}}{2}\right).(5)✦ The scalar function v(γ,ν,p)v(\gamma,\nu,p) is defined by (6): v(γ,ν,p)=γν(1−ν)+γ(1−γ)(p−ν)2.v(\gamma,\nu,p)=\gamma\nu(1-\nu) +\gamma(1-\gamma)(p-\nu)^2.(6)✦

The Claim

Definition 1. For an amplitude function ψ:ℬn→ℂ\psi:\mathcal B_n\to\mathbb C and a site j∈Fin⁡(n)j\in\operatorname{Fin}(n), its excitation population pj(ψ)p_j(\psi) is the real number in (7): pj(ψ)=∑x∈ℬnx(j)=1|ψ(x)|2.p_j(\psi)=\sum_{\substack{x\in\mathcal B_n\\x(j)=1}}|\psi(x)|^2.(7)✦ For an nn-qubit operator PP and a site j∈Fin⁡(n)j\in\operatorname{Fin}(n), its matrix excitation population pj(P)p_j(P) is the real number in (8): pj(P)=∑x∈ℬnx(j)=1Re⁡Pxx.p_j(P)=\sum_{\substack{x\in\mathcal B_n\\x(j)=1}}\operatorname{Re}P_{xx}.(8)✦

Theorem 1. Let γ,ν∈[0,1]\gamma,\nu\in[0,1]. For input excitation population p∈[0,1]p\in[0,1] and phase label s∈Fin⁡(2)s\in\operatorname{Fin}(2), the phase output satisfies (9) and (10): Re⁡det⁡ρs=v(γ,ν,p).\operatorname{Re}\det\rho_s=v(\gamma,\nu,p).(9)✦ S(ρs)=g(v(γ,ν,p)).S(\rho_s)=g\bigl(v(\gamma,\nu,p)\bigr).(10)✦ The bounds on vv are (11) and (12): 0≤v(γ,ν,p)(p∈ℝ).0\leq v(\gamma,\nu,p)\qquad(p\in\mathbb R).(11)✦ v(γ,ν,p)≤14(p∈[0,1]).v(\gamma,\nu,p)\leq\frac14\qquad(p\in[0,1]).(12)✦

In the paper, the result reads: for γ,ν,p∈[0,1]\gamma,\nu,p\in[0,1], a pure qubit state with excitation probability pp has output determinant v(γ,ν,p)v(\gamma,\nu,p) and output entropy e(p)=g(v(γ,ν,p))e(p)=g(v(\gamma,\nu,p)), with 0≤v(γ,ν,p)≤1/40\leq v(\gamma,\nu,p)\leq1/4; for a block input, pjp_j is the probability of outcome 11 at site jj in the computational basis.

What Is Checked

The library defines populations for arbitrary nn-qubit amplitude functions and matrices, and states the phase-output identities for γ,ν,p∈[0,1]\gamma,\nu,p\in[0,1], allowing arbitrary real pp in the lower bound on vv.