Theorem 3 — tight transition: single-copy copies learn Gaussian states with , attained by heterodyne
ProvedBosonicLearn.theorem_3bosonic-gaussian-statesp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquantum-learning
Write . There are universal constants , and such that for all , all and all (which may depend on ), for the class of -mode Gaussian states with and arbitrary mean:
- Sufficiency (heterodyne). Some non-adaptive protocol with independent heterodyne measurements learns every state of the class to trace distance with probability at least .
- Necessity. Every adaptive single-copy scheme (any POVMs, any outcome space, any randomized estimator) that learns every state of the class to trace distance with probability at least uses copies.
Equivalently, for , for , and for : a quantum-to-classical crossover in learnability between cold states (near the vacuum) and warm states (classical sample complexity).
Differences from the source:
- encoding: N = Θ(f) with universal constants → ∃ c, C > 0 placed with ε₀ and n₀ before n, ε, ν; reason: "universal constants"; ν may depend on n
- 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
- encoding: "This bound can be achieved by heterodyne measurements" → a measurable deterministic estimator of N i.i.d. heterodyne outcomes, chosen before the state; reason: the paper's protocol (Corollary 19); a deterministic estimator is the stronger existence claim
Preamble
import Mathlib import Definitions.Def_BosonicLearn_successProb import Definitions.Def_BosonicLearn_heterodyneSuccess import Definitions.Def_BosonicLearn_promiseClass 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 3 (Tight transition of learnability).**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, Theorem 3, Eqs. (6)–(7), pp. 6–7: "There exist universal constants ε_0 > 0 and n_0 ∈ ℕ such that the following
holds for all n ≥ n_0 and 0 < ε < ε_0. Under the promise that an n-mode Gaussian state ρ(µ, Σ) satisfies
Σ ≥ (1/2 + ν)I for some ν > 0 that can depend on n, the necessary and sufficient number of copies to learn ρ to ε trace
distance with probability at least 2/3 using single-copy measurements is given by N = Θ((n²/ε²) min{n, 1 + ν^{−1}}).
… This bound can be achieved by heterodyne measurements for all values of ν > 0."
With `f(n, ε, ν) = (n²/ε²)·min{n, 1 + 1/ν}` there are universal `ε₀ > 0`, `n₀`, `c > 0`, `C > 0` such that for all
`n ≥ n₀`, `ε ∈ (0, ε₀)` and `ν > 0`:
1. (sufficiency, heterodyne) some non-adaptive protocol of `N ≤ C·f` independent heterodyne measurements and a
measurable estimator learns every Gaussian state with `Σ ⪰ (½ + ν)I` to trace distance `ε` with probability `≥ 2/3`;
2. (necessity) every adaptive single-copy scheme on `N` copies, with any measurable outcome space and any randomized
estimator, that learns every such state to trace distance `ε` with probability `≥ 2/3` has `N ≥ c·f`.
**Formalization Note.** `Θ` is read with universal constants placed, like `ε₀, n₀`, before `n, ε, ν`. The protocol is
chosen before the state. Eq. (7) restates (6) and is not a separate claim. -/
theorem theorem_3 :
∃ ε₀ : ℝ, 0 < ε₀ ∧ ∃ n₀ : ℕ, ∃ c : ℝ, 0 < c ∧ ∃ C : ℝ, 0 < C ∧
∀ n : ℕ, n₀ ≤ n → ∀ ε : ℝ, 0 < ε → ε < ε₀ → ∀ ν : ℝ, 0 < ν →
(∃ N : ℕ, (N : ℝ) ≤ C * ((n : ℝ) ^ 2 / ε ^ 2 * min (n : ℝ) (1 + 1 / ν)) ∧
∃ est : (Fin N → EuclideanSpace ℝ (Fin n ⊕ Fin n)) → State (Occupation (Fin n)),
Measurable est ∧
∀ ρ ∈ promiseClass n ν, ENNReal.ofReal (2 / 3) ≤ heterodyneSuccess N est ρ ε) ∧
(∀ (N : ℕ) (O : Type) [MeasurableSpace O] (S : AdaptiveScheme n N O)
(est : Kernel (Fin N → O) (State (Occupation (Fin n)))), IsMarkovKernel est →
(∀ ρ ∈ promiseClass n ν, ENNReal.ofReal (2 / 3) ≤ successProb S est ρ.coefficients ε) →
c * ((n : ℝ) ^ 2 / ε ^ 2 * min (n : ℝ) (1 + 1 / ν)) ≤ N) := by sorry
end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, Theorem 3, Eqs. (6)–(7), pp. 6–7
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.