Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 9 — any (collective) scheme learning passive states with Σ⪰(12+ν)I\Sigma\succeq(\tfrac12+\nu)IΣ⪰(21​+ν)I needs N≥Cn2/ε2N\ge Cn^2/\varepsilon^2N≥Cn2/ε2

Proved
BosonicLearn.theorem_9

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

bosonic-gaussian-statesp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquantum-learning

There are constants C,ε0>0C,\varepsilon_0>0C,ε0​>0 and n0n_0n0​ such that for every ν>0\nu>0ν>0, every ε∈(0,ε0)\varepsilon\in(0,\varepsilon_0)ε∈(0,ε0​) and every n≥n0n\ge n_0n≥n0​: any scheme, including arbitrary collective (entangled) measurements on ρ⊗N\rho^{\otimes N}ρ⊗N, that learns every nnn-mode passive Gaussian state ρ(0,Σ)\rho(0,\Sigma)ρ(0,Σ) with Σ⪰(12+ν)I\Sigma\succeq(\tfrac12+\nu)IΣ⪰(21​+ν)I to trace distance ε\varepsilonε with probability 2/32/32/3 needs

N≥C n2ε2.N\ge C\,\frac{n^2}{\varepsilon^2}.N≥Cε2n2​.

It is the warm-state half of the lower bound in Theorem 3: n2/ε2n^2/\varepsilon^2n2/ε2 copies are necessary even for entangled measurements.

Differences from the source:

  • reading: "for any ν > 0, 0 < ε < ε₀, and sufficiently large n" → n₀ chosen before ν and ε; reason: the stronger reading; the proof's "sufficiently large n" (ensemble (223), Fano (229)) does not depend on ν or ε, and Theorem 3 needs it uniform
  • encoding: "any scheme", "arbitrary collective measurements" → a POVM on the N-copy Fock space whose outcome is the estimated density operator; reason: measurement followed by any classical post-processing is again such a POVM
Preamble
import Mathlib
import Definitions.Def_BosonicLearn_collectiveSuccess
import Definitions.Def_BosonicLearn_promiseClass
import Definitions.Def_BosonicLearn_IsPassive
open QAlgorithms.Papers.Independent.Dependency50.P33 (State traceSize)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

open MeasureTheory ProbabilityTheory
open scoped ENNReal Matrix
Formal statement
namespace BosonicLearn

/-- **Theorem 9 (Matching lower bound for warm states, any collective scheme).**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Theorem 9, p. 65: "There exist constants C > 0 and ε_0 > 0 such that the following holds: For any ν > 0,
0 < ε < ε_0, and sufficiently large n, any scheme that can learn any passive Gaussian state ρ(0, Σ) to ε trace
distance with 2/3 probability with the promise that Σ ≥ (1/2 + ν)I requires at least N ≥ Cn²/ε² copies."
The proof covers "arbitrary collective measurements" (p. 67).

There are `C, ε₀ > 0` and `n₀` such that for every `ν > 0`, `ε ∈ (0, ε₀)`, `n ≥ n₀`, and every POVM on `N` copies
(entangled across copies) whose outcome is the estimate: if every passive Gaussian state with `Σ ⪰ (½ + ν)I` is
learned to trace distance `ε` with probability at least `2/3`, then `N ≥ Cn²/ε²`.

**Formalization Note.** "Sufficiently large n" is read uniformly in `ν` and `ε` (`n₀` before `ν, ε`); see the
Differences list. -/
theorem theorem_9 :
    ∃ C : ℝ, 0 < C ∧ ∃ ε₀ : ℝ, 0 < ε₀ ∧ ∃ n₀ : ℕ, ∀ ν : ℝ, 0 < ν → ∀ ε : ℝ, 0 < ε → ε < ε₀ →
      ∀ n : ℕ, n₀ ≤ n →
      ∀ (N : ℕ) (E : FockPOVM (Fin N → Occupation (Fin n)) (State (Occupation (Fin n)))),
        (∀ ρ ∈ promiseClass n ν, IsPassive ρ → ENNReal.ofReal (2 / 3) ≤ collectiveSuccess E ρ ε) →
        C * ((n : ℝ) ^ 2 / ε ^ 2) ≤ N := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, Theorem 9, p. 65 (collective measurements, p. 67)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 8, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me