Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Data processing for a thresholded photon count: ∣Pr⁡ρR2(K>τ)−Pr⁡ρR1(K>τ)∣≤∥ρR2−ρR1∥1|\Pr_{\rho_{R_2}}(K>\tau)-\Pr_{\rho_{R_1}}(K>\tau)|\le\|\rho_{R_2}-\rho_{R_1}\|_1∣PrρR2​​​(K>τ)−PrρR1​​​(K>τ)∣≤∥ρR2​​−ρR1​​∥1​

Proved
BosonicLearn.fugacity_count_test

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

bosonic-gaussian-statesquantum-informationquantum-learning

Data processing for the two-outcome measurement "rotate by a passive unitary, count the photons in a set of modes, compare with a threshold".

Let R1,R2R_1,R_2R1​,R2​ be fugacity matrices (positive semidefinite with 1−Ri1-R_i1−Ri​ positive definite), ρR=det⁡(1−R)Γ(R)\rho_{R}=\det(1-R)\Gamma(R)ρR​=det(1−R)Γ(R), UUU a unitary n×nn\times nn×n matrix, AAA a set of modes and τ∈N\tau\in\mathbb Nτ∈N. Let pk(i)=∑w:∑j∈Awj=k⟨w∣ρURiU†∣w⟩p^{(i)}_k=\sum_{w:\sum_{j\in A}w_j=k}\langle w|\rho_{UR_iU^\dagger}|w\ranglepk(i)​=∑w:∑j∈A​wj​=k​⟨w∣ρURi​U†​∣w⟩ be the law of the photon count KKK in the modes AAA after the passive unitary of UUU. Then

∣∑k>τpk(2)−∑k>τpk(1)∣≤∥ρR2−ρR1∥1.\Big|\sum_{k>\tau}p^{(2)}_k-\sum_{k>\tau}p^{(1)}_k\Big|\le\big\|\rho_{R_2}-\rho_{R_1}\big\|_1 .​k>τ∑​pk(2)​−k>τ∑​pk(1)​​≤​ρR2​​−ρR1​​​1​.

Role. Last step of the proof of Lemma 12 (Eqs. (147)–(148)): a gap between the two tail probabilities of the photon count lower-bounds the trace distance of the two states.

Formalization Note The right-hand side is the full trace norm traceSize (without the factor 12\tfrac1221​ of the trace distance; the constant is immaterial for Lemma 12). ρR\rho_RρR​ is fugacityCoeff R; the rotated state is written fugacityCoeff (U * R * Uᴴ), which is Γ(U)ρRΓ(U)†\Gamma(U)\rho_R\Gamma(U)^\daggerΓ(U)ρR​Γ(U)†.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P33

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

/-- **Data processing for a thresholded photon count.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §5.7, proof of Lemma 12, Eqs. (147)–(148): "Coarse-graining the photon count into the two outcomes {K̂ > τ} and {K̂ ≤ τ}
gives a classical total variation distance equal to the absolute value of the left-hand side of Eq. (147). By data
processing for trace distance …".

Let `R₁, R₂` be fugacity matrices (positive semidefinite, `1 − R_i` positive definite), `U` a unitary matrix, `A` a set
of modes and `τ` a threshold. For `i = 1, 2` let `p^{(i)}_k = ∑_{w : ∑_{j∈A} w_j = k} ⟨w|ρ_{U R_i U†}|w⟩` be the law of the
photon count in the modes `A` after the passive unitary of `U`. Then

`|∑_{k > τ} p^{(2)}_k − ∑_{k > τ} p^{(1)}_k| ≤ ‖ρ_{R₂} − ρ_{R₁}‖₁`.

**Formalization Note.** The right-hand side is the full trace norm `traceSize` (no factor `½`); the constant is
irrelevant for Lemma 12. `ρ_R` is `fugacityCoeff R`. -/
theorem fugacity_count_test {n : ℕ} (R₁ R₂ : Matrix (Fin n) (Fin n) ℂ) (h₁ : R₁.PosSemidef)
    (h₁' : (1 - R₁).PosDef) (h₂ : R₂.PosSemidef) (h₂' : (1 - R₂).PosDef)
    (U : Matrix (Fin n) (Fin n) ℂ) (hU : Uᴴ * U = 1) (A : Finset (Fin n)) (τ : ℕ) :
    ENNReal.ofReal |(∑' k : ℕ, if τ < k then (∑' w : Occupation (Fin n),
          if ∑ i ∈ A, w i = k then (fugacityCoeff (U * R₂ * Uᴴ) w w).re else 0) else 0) -
        ∑' k : ℕ, if τ < k then (∑' w : Occupation (Fin n),
          if ∑ i ∈ A, w i = k then (fugacityCoeff (U * R₁ * Uᴴ) w w).re else 0) else 0| ≤
      traceSize (fugacityCoeff R₂ - fugacityCoeff R₁) := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §5.7 (Delayed proof for Lemma 12), proof of Lemma 12, Eqs. (147)–(148) (coarse-graining of the photon count and data processing)

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