Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5 — adaptive single-copy learning of passive states with Σ⪰(12+ν)I\Sigma\succeq(\tfrac12+\nu)IΣ⪰(21​+ν)I, 1n≤ν≤1\tfrac1n\le\nu\le1n1​≤ν≤1, needs Ω(n2/(νε2))\Omega(n^2/(\nu\varepsilon^2))Ω(n2/(νε2)) copies

Proved
BosonicLearn.theorem_5

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

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

There are ε0,c>0\varepsilon_0,c>0ε0​,c>0 and n0n_0n0​ such that for every n≥n0n\ge n_0n≥n0​, every ν∈[1/n,1]\nu\in[1/n,1]ν∈[1/n,1] and every ε∈(0,ε0)\varepsilon\in(0,\varepsilon_0)ε∈(0,ε0​): if an adaptive single-copy scheme on NNN copies, with any outcome space and any (randomized) estimator, learns every nnn-mode passive Gaussian state with Σ⪰(12+ν)I\Sigma\succeq(\tfrac12+\nu)IΣ⪰(21​+ν)I to trace distance ε\varepsilonε with probability at least 2/32/32/3, then

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

For ν=1/n\nu=1/nν=1/n this is Ω(n3/ε2)\Omega(n^3/\varepsilon^2)Ω(n3/ε2) and for ν=1\nu=1ν=1 the classical Ω(n2/ε2)\Omega(n^2/\varepsilon^2)Ω(n2/ε2); heterodyne detection attains it (Theorem 8).

Differences from the source:

  • reading: "for any sufficiently small ε", N = Ω(n²/(νε²)) → ∃ ε₀, c > 0 and n₀, uniform in ν and ε, with n ≥ n₀; reason: the asymptotic meaning of Ω; it is what the proof of Theorem 3 uses
  • encoding: "single-copy measurements", possibly adaptive, with an estimator → adaptive schemes of POVMs with an arbitrary measurable outcome space, round laws measurable in the earlier outcomes, and a Markov-kernel estimator to density operators; reason: the paper's model (§1.1 p. 5, §4 p. 19, §5.1 p. 30); measurability makes the transcript a random variable
Preamble
import Mathlib
import Definitions.Def_BosonicLearn_successProb
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 5 (Tight single-copy lower bound for all-temperature Gaussian states).**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Theorem 5, p. 29: "For any sufficiently small ε > 0, any single-copy adaptive scheme that can learn any
n-mode passive Gaussian state, given the promise that Σ ≥ (1/2 + ν)I for any 1/n ≤ ν ≤ 1, to trace distance
precision ε with at least 2/3 probability requires at least N = Ω(n²/(νε²)) copies."

There are `ε₀, c > 0` and `n₀` such that for every `n ≥ n₀`, `ν ∈ [1/n, 1]`, `ε ∈ (0, ε₀)`, every `N`, every adaptive
single-copy scheme on `N` copies with any measurable outcome space and every (randomized) estimator: if every passive
Gaussian state with `Σ ⪰ (½ + ν)I` is learned to trace distance `ε` with probability at least `2/3`, then
`N ≥ c n²/(νε²)`.

**Formalization Note.** `Ω(·)` is read with a universal constant and a threshold `n₀` (asymptotic in `n`), uniform in
`ν` and `ε`. The class is the passive states of the promise class. -/
theorem theorem_5 :
    ∃ ε₀ : ℝ, 0 < ε₀ ∧ ∃ c : ℝ, 0 < c ∧ ∃ n₀ : ℕ, ∀ n : ℕ, n₀ ≤ n →
      ∀ ν : ℝ, 1 / (n : ℝ) ≤ ν → ν ≤ 1 → ∀ ε : ℝ, 0 < ε → ε < ε₀ →
      ∀ (N : ℕ) (O : Type) [MeasurableSpace O] (S : AdaptiveScheme n N O)
        (est : Kernel (Fin N → O) (State (Occupation (Fin n)))), IsMarkovKernel est →
        (∀ ρ ∈ promiseClass n ν, IsPassive ρ →
          ENNReal.ofReal (2 / 3) ≤ successProb S est ρ.coefficients ε) →
        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 5, p. 29
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