Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Gaussian cross entropy in general quadrature conventions

Open
QAlgorithms.Papers.Independent.Intakethird100.P17.gaussian_cross_entropy

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n≥0n\ge0n≥0, κ>0\kappa>0κ>0, and let ρj=ρ(σj,uj)\rho_j=\rho(\sigma_j,u_j)ρj​=ρ(σj​,uj​), j=1,2j=1,2j=1,2, be normalized finite-energy Gaussian densities on the full nnn-mode oscillator space, with arbitrary finite means uj∈R2nu_j\in\mathbb R^{2n}uj​∈R2n and centered half-anticommutator covariances σj\sigma_jσj​. The quadratures satisfy [q,qT]=iΩ/κ[q,q^T]=i\Omega/\kappa[q,qT]=iΩ/κ, where Ω\OmegaΩ is the direct sum of the canonical two-dimensional antisymmetric form. Assume each symplectic eigenvalue of each covariance is strictly greater than 1/(2κ)1/(2\kappa)1/(2κ). Put δ=u2−u1\delta=u_2-u_1δ=u2​−u1​ and G2=2iΩarcoth⁡(2κσ2iΩ)G_2=2i\Omega\operatorname{arcoth}(2\kappa\sigma_2 i\Omega)G2​=2iΩarcoth(2κσ2​iΩ). Then the cross entropy is finite and

−Tr⁡(ρ1log⁡2ρ2)=Σκ(σ1,σ2,δ):=ln⁡det⁡(κσ2+iΩ/2)+κtr⁡(σ1G2)+κδTG2δ2ln⁡2.-\operatorname{Tr}(\rho_1\log_2\rho_2) =\Sigma_\kappa(\sigma_1,\sigma_2,\delta) :=\frac{\ln\det(\kappa\sigma_2+i\Omega/2)+\kappa\operatorname{tr}(\sigma_1G_2)+\kappa\delta^TG_2\delta}{2\ln2}.−Tr(ρ1​log2​ρ2​)=Σκ​(σ1​,σ2​,δ):=2ln2lndet(κσ2​+iΩ/2)+κtr(σ1​G2​)+κδTG2​δ​.

A simultaneous displacement of both states gives the centered calculation in (A18). The identity does not require commuting covariance matrices or commuting density operators.

Formalization Note Cross entropy is independently computed from bounded support-log cutoffs of the actual density operator. The theorem asserts convergence to the displayed expression; the matrix inverse-coth series also has an explicit convergence conclusion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P17
Formal statement
noncomputable section

open Filter

open scoped BigOperators ENNReal ComplexOrder Topology Matrix

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P17

open QAlgorithms.Papers.Independent.Claimed50.P30
  (ModeOperator Quadrature PhaseVector numberKet trace TraceSummable
   FockWeylSystem GaussianMoments canonicalOmega)

open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass relativeEntropy)

open QAlgorithms.Papers.Independent.Next46.P17 (raisingCoefficient)

/-- arXiv:1808.00608v4, Appendix A, PDF p.7, (A18)--(A19).
Arbitrary finite means; strict Gibbs domain for both covariances. The common
displacement leaves delta=u2-u1; no commuting-covariance premise is imposed. -/
theorem gaussian_cross_entropy {n : ℕ}
    (W : FockWeylSystem n) (kappa : ℝ) (hkappa : 0 < kappa)
    (rho1 rho2 : ModeOperator n) (u1 u2 : PhaseVector n)
    (sigma1 sigma2 : Matrix (Quadrature n) (Quadrature n) ℝ)
    (h1 : GaussianInConvention W kappa rho1 u1 sigma1)
    (h2 : GaussianInConvention W kappa rho2 u2 sigma2)
    (hs1 : StrictGibbsCovariance kappa sigma1)
    (hs2 : StrictGibbsCovariance kappa sigma2) :
    Summable (gibbsSeriesTerm kappa sigma1) ∧
    Summable (gibbsSeriesTerm kappa sigma2) ∧
    (∀ k, TraceSummable (rho1.comp (oscillatorLogCutoff rho2 k))) ∧
    Tendsto (crossEntropyCutoff rho1 rho2) atTop
      (nhds (gaussianSigma kappa sigma1 sigma2 (u2 - u1))) ∧
    oscillatorCrossEntropy rho1 rho2 = gaussianSigma kappa sigma1 sigma2 (u2 - u1) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P17

end
Source
Tight bounds for private communication over bosonic Gaussian channels based on teleportation simulation with optimal finite resources, arXiv:1808.00608v4, PDF p. 7, Appendix A Eqs. (A18)–(A19): Gaussian cross entropy in κ conventions
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn, put F={0,…,n−1}→NF=\{0,\ldots,n-1\}\to\mathbb NF={0,…,n−1}→N, Hn=ℓ2(F;C)\mathcal H_n=\ell^2(F;\mathbb C)Hn​=ℓ2(F;C), J={0,…,n−1}×{0,1}J=\{0,\ldots,n-1\}\times\{0,1\}J={0,…,n−1}×{0,1}, and let eje_jej​ be the standard basis. Suppose W(ξ)W(\xi)W(ξ), for real ξ∈RJ\xi\in\mathbb R^Jξ∈RJ, is a unitary bounded operator with

(W(ξ)ej)i=∏r=0n−1D−ξ(r,1)+iξ(r,0)(ir,jr),Dz(a,b)=e−∣z∣2/2a! b!∑ℓ=0min⁡(a,b)za−ℓ(−z‾)b−ℓℓ!(a−ℓ)!(b−ℓ)!.(W(\xi)e_j)_i=\prod_{r=0}^{n-1}\mathcal D_{-\xi_{(r,1)}+i\xi_{(r,0)}}(i_r,j_r), \quad \mathcal D_z(a,b)=e^{-|z|^2/2}\sqrt{a!\,b!} \sum_{\ell=0}^{\min(a,b)} \frac{z^{a-\ell}(-\overline z)^{b-\ell}} {\ell!(a-\ell)!(b-\ell)!}.(W(ξ)ej​)i​=r=0∏n−1​D−ξ(r,1)​+iξ(r,0)​​(ir​,jr​),Dz​(a,b)=e−∣z∣2/2a!b!​ℓ=0∑min(a,b)​ℓ!(a−ℓ)!(b−ℓ)!za−ℓ(−z)b−ℓ​.

Let κ>0\kappa>0κ>0, let ρ1,ρ2\rho_1,\rho_2ρ1​,ρ2​ be bounded complex linear operators on Hn\mathcal H_nHn​, let u1,u2∈RJu_1,u_2\in\mathbb R^Ju1​,u2​∈RJ, and let σ1,σ2\sigma_1,\sigma_2σ1​,σ2​ be real J×JJ\times JJ×J matrices. For each r=1,2r=1,2r=1,2, assume that ρrx=∑ℓ⟨vℓ,x⟩wℓ\rho_r x=\sum_\ell\langle v_\ell,x\rangle w_\ellρr​x=∑ℓ​⟨vℓ​,x⟩wℓ​ for some sequences with ∑ℓ∥vℓ∥∥wℓ∥<∞\sum_\ell\|v_\ell\|\|w_\ell\|<\infty∑ℓ​∥vℓ​∥∥wℓ​∥<∞, that ρr∗=ρr\rho_r^*=\rho_rρr∗​=ρr​ and Re⁡⟨x,ρrx⟩≥0\operatorname{Re}\langle x,\rho_rx\rangle\ge0Re⟨x,ρr​x⟩≥0 for all xxx, that its number-basis trace series is summable and equals 111, and that ∑j(∑mjm)Re⁡⟨ej,ρrej⟩\sum_j(\sum_mj_m)\operatorname{Re}\langle e_j,\rho_re_j\rangle∑j​(∑m​jm​)Re⟨ej​,ρr​ej​⟩ is summable. Let Ω(m,0),(m,1)=1\Omega_{(m,0),(m,1)}=1Ω(m,0),(m,1)​=1, Ω(m,1),(m,0)=−1\Omega_{(m,1),(m,0)}=-1Ω(m,1),(m,0)​=−1, with all other entries zero. Assume for each rrr that 2κσr2\kappa\sigma_r2κσr​ is symmetric and positive definite, that 2κσr+iΩ2\kappa\sigma_r+i\Omega2κσr​+iΩ is positive semidefinite, and that for every real ξ\xiξ the trace series of ρrW(ξ)\rho_rW(\xi)ρr​W(ξ) is summable and

∑j⟨ej,ρrW(ξ)ej⟩=exp⁡ ⁣(−κ∑a,bξa(σr)abξb+i2κ∑a(ur)aξa).\sum_j\langle e_j,\rho_rW(\xi)e_j\rangle =\exp\!\left( -\kappa\sum_{a,b}\xi_a(\sigma_r)_{ab}\xi_b +i\sqrt{2\kappa}\sum_a(u_r)_a\xi_a \right).j∑​⟨ej​,ρr​W(ξ)ej​⟩=exp​−κa,b∑​ξa​(σr​)ab​ξb​+i2κ​a∑​(ur​)a​ξa​​.

Assume additionally, for both rrr, that σr\sigma_rσr​ is symmetric and positive definite and that the complex matrix κσr+i2Ω\kappa\sigma_r+\frac{i}{2}\Omegaκσr​+2i​Ω is positive definite. Define

Br=2κσr(iΩ),Hr,k=(Br−1)2k+12k+1,G2=Re⁡ ⁣(2iΩ∑k=0∞H2,k)B_r=2\kappa\sigma_r(i\Omega),\qquad H_{r,k}=\frac{(B_r^{-1})^{2k+1}}{2k+1},\qquad G_2=\operatorname{Re}\!\left(2i\Omega\sum_{k=0}^{\infty}H_{2,k}\right)Br​=2κσr​(iΩ),Hr,k​=2k+1(Br−1​)2k+1​,G2​=Re(2iΩk=0∑∞​H2,k​)

entrywise, and put

δ=u2−u1,S=log⁡ ⁣(Re⁡det⁡(κσ2+i2Ω))+κtr⁡(σ1G2)+κ∑a,bδa(G2)abδb2log⁡2.\delta=u_2-u_1,\qquad S= \frac{ \log\!\left(\operatorname{Re}\det(\kappa\sigma_2+\tfrac{i}{2}\Omega)\right) +\kappa\operatorname{tr}(\sigma_1G_2) +\kappa\sum_{a,b}\delta_a(G_2)_{ab}\delta_b }{2\log 2}.δ=u2​−u1​,S=2log2log(Redet(κσ2​+2i​Ω))+κtr(σ1​G2​)+κ∑a,b​δa​(G2​)ab​δb​​.

Then both matrix series ∑kH1,k\sum_kH_{1,k}∑k​H1,k​ and ∑kH2,k\sum_kH_{2,k}∑k​H2,k​ are summable. For every natural number kkk, the number-basis trace series of ρ1fk(ρ2)\rho_1 f_k(\rho_2)ρ1​fk​(ρ2​) is summable, where fk(x)=log⁡(max⁡{x,1/(k+1)})/log⁡2f_k(x)=\log(\max\{x,1/(k+1)\})/\log2fk​(x)=log(max{x,1/(k+1)})/log2 is applied by the real continuous functional calculus. Moreover,

−Re⁡∑j⟨ej,ρ1fk(ρ2)ej⟩⟶Sas k→∞,-\operatorname{Re}\sum_j\langle e_j,\rho_1 f_k(\rho_2)e_j\rangle \longrightarrow S \quad\text{as }k\to\infty,−Rej∑​⟨ej​,ρ1​fk​(ρ2​)ej​⟩⟶Sas k→∞,

and the value selected by the total filter-limit definition of this cutoff sequence equals SSS. No assumption n>0n>0n>0 is present, so the zero-mode case is included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me