Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rényi-2 overlap of ρR⊗N\rho_R^{\otimes N}ρR⊗N​ with a thermal state: (det⁡(1−R)2/((1−r0)ndet⁡(1−R2/r0)))N\big(\det(1-R)^2/((1-r_0)^n\det(1-R^2/r_0))\big)^N(det(1−R)2/((1−r0​)ndet(1−R2/r0​)))N

Proved
BosonicLearn.fugacity_renyi2_tensorPow

by Senrui Chen · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesquantum-informationquantum-learning

A closed form for Tr⁡(ρ σ−1/2ρ σ−1/2)\operatorname{Tr}(\rho\,\sigma^{-1/2}\rho\,\sigma^{-1/2})Tr(ρσ−1/2ρσ−1/2) when ρ\rhoρ is NNN copies of a passive Gaussian state and σ\sigmaσ is NNN copies of a thermal state.

Let RRR be a fugacity matrix (0⪯R≺10\preceq R\prec\mathbf 10⪯R≺1) with R2≺r01R^2\prec r_0\mathbf 1R2≺r0​1, 0<r0<10<r_0<10<r0​<1, let ρR=det⁡(1−R)Γ(R)\rho_R=\det(\mathbf 1-R)\Gamma(R)ρR​=det(1−R)Γ(R) and p0(u)=(1−r0)nr0∣u∣p_0(u)=(1-r_0)^nr_0^{|u|}p0​(u)=(1−r0​)nr0∣u∣​ (the diagonal of the thermal state of fugacity r0r_0r0​). Then ρR⊗N\rho_R^{\otimes N}ρR⊗N​ is a density operator, the weights ∏tp0(xt)\prod_tp_0(x_t)∏t​p0​(xt​) on (Nn)N(\mathbb N^n)^N(Nn)N are positive with sum 111, det⁡(1−R2/r0)>0\det(\mathbf 1-R^2/r_0)>0det(1−R2/r0​)>0, and

∑x,y∣(ρR⊗N)xy∣2∏tp0(xt)∏tp0(yt)=(det⁡(1−R)2(1−r0)n det⁡(1−R2/r0))N.\sum_{x,y}\frac{\big|(\rho_R^{\otimes N})_{xy}\big|^2}{\sqrt{\prod_tp_0(x_t)\prod_tp_0(y_t)}}=\Big(\frac{\det(\mathbf 1-R)^2}{(1-r_0)^n\,\det(\mathbf 1-R^2/r_0)}\Big)^N .x,y∑​∏t​p0​(xt​)∏t​p0​(yt​)​​(ρR⊗N​)xy​​2​=((1−r0​)ndet(1−R2/r0​)det(1−R)2​)N.

Proof idea: Γ(R)\Gamma(R)Γ(R) is block diagonal in the photon number, Γ(cR)uv=c∣u∣Γ(R)uv\Gamma(cR)_{uv}=c^{|u|}\Gamma(R)_{uv}Γ(cR)uv​=c∣u∣Γ(R)uv​, Γ\GammaΓ is multiplicative and Tr⁡Γ(A)=1/det⁡(1−A)\operatorname{Tr}\Gamma(A)=1/\det(\mathbf 1-A)TrΓ(A)=1/det(1−A); sums over NNN copies factorize.

Formalization Note fugacityCoeff R is ρR\rho_RρR​; the tensor power is WildeQIT.Schumacher.tensorPow. Real parts of the (positive real) determinants are used.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33
import Definitions.Def_WildeQIT_Schumacher_tensorPow

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity traceSize)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)
open scoped ENNReal Matrix ComplexOrder
Formal statement
namespace BosonicLearn

/-- **Rényi-2 overlap of `N` copies of a passive Gaussian state with a thermal reference state.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §8, proof of Theorem 9, Eqs. (230)–(234), pp. 66–67 (the Holevo quantity of the ensemble `{ρ_{U_a}^{⊗N}}` is bounded
through the pairwise divergences of single copies); here the divergence is the Rényi-2 quantity
`Tr(ρ σ^{−1/2} ρ σ^{−1/2})` relative to the thermal state `σ = (1 − r₀)ⁿ Γ(r₀·1)`.

Let `R` be a fugacity matrix (`0 ⪯ R ≺ 1`) with `R² ≺ r₀·1`, `0 < r₀ < 1`, and let `p₀(u) = (1 − r₀)ⁿ r₀^{|u|}` be the
diagonal of the thermal state. Then `ρ_R^{⊗N}` is a density operator, the weights `∏ₜ p₀(x_t)` on `(ℕⁿ)^N` are positive
with sum `1`, and

`∑_{x,y} |(ρ_R^{⊗N})_{xy}|² / √(∏ₜ p₀(x_t) ∏ₜ p₀(y_t)) = ( det(1 − R)² / ((1 − r₀)ⁿ det(1 − R²/r₀)) )^N`.

**Formalization Note.** `ρ_R = det(1 − R)Γ(R)` is `fugacityCoeff R`; `ρ^{⊗N}` is `WildeQIT.Schumacher.tensorPow`. For one
copy, `Γ(R)` is block diagonal in the photon number, `Γ(r₀^{−1/2}R)_{uv} = r₀^{−|u|/2}Γ(R)_{uv}`, `Γ` is multiplicative and
`Tr Γ(A) = 1/det(1 − A)`. Both determinants are positive reals; their real parts are used. -/
theorem fugacity_renyi2_tensorPow {n : ℕ} (R : Matrix (Fin n) (Fin n) ℂ) (hR : R.PosSemidef)
    (hR1 : (1 - R).PosDef) (r₀ : ℝ) (h0 : 0 < r₀) (h1 : r₀ < 1)
    (hR2 : (((r₀ : ℝ) : ℂ) • (1 : Matrix (Fin n) (Fin n) ℂ) - R * R).PosDef) (N : ℕ) :
    IsDensity (WildeQIT.Schumacher.tensorPow N (fugacityCoeff R)) ∧
    HasSum (fun x : Fin N → Occupation (Fin n) => ∏ t, ((1 - r₀) ^ n * r₀ ^ (∑ i, x t i))) 1 ∧
    0 < (1 - ((r₀⁻¹ : ℝ) : ℂ) • (R * R)).det.re ∧
    HasSum (fun x : (Fin N → Occupation (Fin n)) × (Fin N → Occupation (Fin n)) =>
        ‖WildeQIT.Schumacher.tensorPow N (fugacityCoeff R) x.1 x.2‖ ^ 2 /
          Real.sqrt ((∏ t, ((1 - r₀) ^ n * r₀ ^ (∑ i, x.1 t i))) *
            ∏ t, ((1 - r₀) ^ n * r₀ ^ (∑ i, x.2 t i))))
      (((1 - R).det.re ^ 2 /
        ((1 - r₀) ^ n * (1 - ((r₀⁻¹ : ℝ) : ℂ) • (R * R)).det.re)) ^ N) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §8, proof of Theorem 9, pp. 65–67 (Eqs. (230)–(234): the divergence of the ensemble {ρUa⊗N}\{\rho_{U_a}^{\otimes N}\}{ρUa​⊗N​} is bounded through single copies)

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me