Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Photon count of a passive Gaussian state on a subspace of modes: E zK=det⁡(1+(1−z)B)−1\mathbb E\,z^{K}=\det(1+(1-z)B)^{-1}EzK=det(1+(1−z)B)−1

Proved
BosonicLearn.fugacity_count_pgf

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

bosonic-gaussian-statesquantum-informationquantum-learning

The probability generating function of the photon number in a subspace of modes, for a passive Gaussian state.

Let RRR be a fugacity matrix (positive semidefinite with 1−R1-R1−R positive definite), N=R(1−R)−1N=R(1-R)^{-1}N=R(1−R)−1 its photon occupation matrix, UUU a unitary n×nn\times nn×n matrix and AAA a set of modes. Apply the passive unitary of UUU to ρR=det⁡(1−R)Γ(R)\rho_R=\det(1-R)\Gamma(R)ρR​=det(1−R)Γ(R) (this gives ρURU†\rho_{URU^\dagger}ρURU†​) and count the photons in the modes of AAA: outcome kkk has probability pk=∑w:∑i∈Awi=k⟨w∣ρURU†∣w⟩≥0p_k=\sum_{w:\sum_{i\in A}w_i=k}\langle w|\rho_{URU^\dagger}|w\rangle\ge0pk​=∑w:∑i∈A​wi​=k​⟨w∣ρURU†​∣w⟩≥0. Then for 0≤z≤10\le z\le10≤z≤1

∑k≥0pk zk=1det⁡(1+(1−z)B),B=PA UNU† PA,\sum_{k\ge0}p_k\,z^k=\frac1{\det\big(1+(1-z)B\big)},\qquad B=P_A\,UNU^\dagger\,P_A ,k≥0∑​pk​zk=det(1+(1−z)B)1​,B=PA​UNU†PA​,

where PAP_APA​ is the coordinate projection on the modes of AAA; the determinant is real and positive.

Consequence. If λi\lambda_iλi​ are the eigenvalues of BBB, the right-hand side is ∏i11+λi(1−z)\prod_i\frac1{1+\lambda_i(1-z)}∏i​1+λi​(1−z)1​, the generating function of a sum of independent geometric variables with means λi\lambda_iλi​ (Eqs. (135)–(136) of the paper).

Checked numerically for random 222-mode RRR, UUU, all AAA and several zzz.

Formalization Note BBB is kept as an n×nn\times nn×n matrix supported on A×AA\times AA×A (the paper's BXB_XBX​ padded by zeros), which has the same determinant det⁡(1+(1−z)B)\det(1+(1-z)B)det(1+(1−z)B). The statement is a conjunction: pk≥0p_k\ge0pk​≥0 for all kkk; and for each z∈[0,1]z\in[0,1]z∈[0,1], positivity of the real part of the determinant and HasSum.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_fugacityCoeff

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

/-- **Photon counting on a subspace of modes: probability generating function.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §5.7, proof of Lemma 12, Eqs. (135)–(136): "We now measure the total photon number in the mode subspace ran Π₊ … The reduced
state on these m modes is again a passive Gaussian state, and its photon occupation matrix is B_X … E z^{K_X} =
det(I + (1 − z)B_X)^{−1}."

Let `R` be positive semidefinite with `1 − R` positive definite, `U` a unitary matrix and `A` a set of modes. Rotate
the passive Gaussian state `ρ_R = det(1 − R)Γ(R)` by the passive unitary of `U` (this gives `ρ_{URU†}`) and count the
photons in the modes of `A`: the outcome `k` has probability `p_k = ∑_{w : ∑_{i∈A} w_i = k} ⟨w|ρ_{URU†}|w⟩`. Then
`p_k ≥ 0` and, for `0 ≤ z ≤ 1`,

`∑ₖ p_k zᵏ = 1 / det(1 + (1 − z) B)`,  `B = P_A U N U† P_A`,  `N = R(1 − R)⁻¹`,

where `P_A` is the coordinate projection onto the modes of `A`; the determinant is a positive real number.

**Formalization Note.** `B` is kept as an `n × n` matrix supported on `A × A` (the paper's `B_X` padded by zeros), so
`det(1 + (1 − z)B)` is the determinant of the paper. -/
theorem fugacity_count_pgf {n : ℕ} (R : Matrix (Fin n) (Fin n) ℂ) (hR : R.PosSemidef)
    (hR1 : (1 - R).PosDef) (U : Matrix (Fin n) (Fin n) ℂ) (hU : Uᴴ * U = 1) (A : Finset (Fin n)) :
    (∀ k : ℕ, 0 ≤ ∑' w : Occupation (Fin n),
        if ∑ i ∈ A, w i = k then (fugacityCoeff (U * R * Uᴴ) w w).re else 0) ∧
    ∀ z : ℝ, 0 ≤ z → z ≤ 1 →
      0 < (1 + ((1 - z : ℝ) : ℂ) • (Matrix.diagonal (fun i => if i ∈ A then (1 : ℂ) else 0) *
          (U * (R * (1 - R)⁻¹) * Uᴴ) * Matrix.diagonal (fun i => if i ∈ A then (1 : ℂ) else 0))).det.re ∧
      HasSum (fun k : ℕ => (∑' w : Occupation (Fin n),
            if ∑ i ∈ A, w i = k then (fugacityCoeff (U * R * Uᴴ) w w).re else 0) * z ^ k)
        ((1 + ((1 - z : ℝ) : ℂ) • (Matrix.diagonal (fun i => if i ∈ A then (1 : ℂ) else 0) *
          (U * (R * (1 - R)⁻¹) * Uᴴ) *
          Matrix.diagonal (fun i => if i ∈ A then (1 : ℂ) else 0))).det.re)⁻¹ := 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. (135)–(136)

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