Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An adaptive single-copy scheme is one POVM on H⊗N\mathcal H^{\otimes N}H⊗N with the transcript as outcome

Proved
BosonicLearn.adaptive_scheme_product_povm

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

bosonic-gaussian-statesquantum-informationquantum-learning

An adaptive sequence of single-copy measurements on NNN copies is one measurement on the NNN-copy system.

Let H=ℓ2(Nn)\mathcal H=\ell^2(\mathbb N^n)H=ℓ2(Nn) be the nnn-mode Fock space. An adaptive single-copy scheme on NNN copies with outcomes in a measurable space OOO assigns to every round t∈{1,…,N}t\in\{1,\dots,N\}t∈{1,…,N} and every record x<t=(x1,…,xt−1)x_{<t}=(x_1,\dots,x_{t-1})x<t​=(x1​,…,xt−1​) of earlier outcomes a POVM M(x<t)M^{(x_{<t})}M(x<t​) on H\mathcal HH with outcomes in OOO, measured on a fresh copy, such that the outcome law of round ttt depends measurably on x<tx_{<t}x<t​. For density operators τ1,…,τN\tau_1,\dots,\tau_Nτ1​,…,τN​ on H\mathcal HH let Tτ1,…,τNT_{\tau_1,\dots,\tau_N}Tτ1​,…,τN​​ be the law on ONO^NON of the transcript when round ttt measures τt\tau_tτt​: the first outcome has law B↦Tr⁡(M(B)τ1)B\mapsto\operatorname{Tr}(M(B)\tau_1)B↦Tr(M(B)τ1​), and given x<tx_{<t}x<t​ the ttt-th outcome has law B↦Tr⁡(M(x<t)(B) τt)B\mapsto\operatorname{Tr}\big(M^{(x_{<t})}(B)\,\tau_t\big)B↦Tr(M(x<t​)(B)τt​).

Then there is a POVM MMM on H⊗N\mathcal H^{\otimes N}H⊗N with outcomes in ONO^NON such that for all density operators τ1,…,τN\tau_1,\dots,\tau_Nτ1​,…,τN​ on H\mathcal HH and every measurable B⊆ONB\subseteq O^NB⊆ON

Tr⁡ ⁣(M(B) τ1⊗⋯⊗τN)=Tτ1,…,τN(B).\operatorname{Tr}\!\big(M(B)\,\tau_1\otimes\cdots\otimes\tau_N\big)=T_{\tau_1,\dots,\tau_N}(B).Tr(M(B)τ1​⊗⋯⊗τN​)=Tτ1​,…,τN​​(B).

For τ1=⋯=τN=ρ\tau_1=\dots=\tau_N=\rhoτ1​=⋯=τN​=ρ the right-hand side is the transcript law TρT_\rhoTρ​ of the scheme on NNN copies of ρ\rhoρ.

Role. This is the precise sense in which single-copy (non-entangled) schemes are a subclass of collective measurements on ρ⊗N\rho^{\otimes N}ρ⊗N. With BosonicLearn.fockPOVM_postprocess applied to the estimator it gives BosonicLearn.adaptive_scheme_collective.

Formalization Note The scheme is an AdaptiveScheme n N O; the right-hand side is sequentialLaw of the round kernels x<t↦x_{<t}\mapstox<t​↦ S.round τ_t t. The product state has entries ∏tτt(ut,vt)\prod_t\tau_t(u_t,v_t)∏t​τt​(ut​,vt​) on the index type {1,…,N}→Nn\{1,\dots,N\}\to\mathbb N^n{1,…,N}→Nn. MMM is a FockPOVM, so its Born law is a probability measure on every density operator of the NNN-copy space, entangled ones included; the identity is asserted on product states. Non-identical factors are allowed because the statement composes round by round in that form.

Related platform material The space ℓ2(A)\ell^2(A)ℓ2(A) used here (Hilbert A) is the same Lean type as OAI.TensorLp.H A, and ℓ2(Nn)\ell^2(\mathbb N^n)ℓ2(Nn) is the same type as OAI.EntropyPhotonNumber.Fock n. The published definitions OAI_Analysis_TensorLp (tensor products, slices and operator lifts on ℓ2(A×B)\ell^2(A\times B)ℓ2(A×B)) and OAI_MathematicalPhysics_Fock_Operators (OAI.CrossEnsemble.operator, the bounded operator ∑i∣ui⟩⟨vi∣\sum_i|u_i\rangle\langle v_i|∑i​∣ui​⟩⟨vi​∣ of a family, with hasSum_operator and entry_hasSum) are sorry-free and can be imported. The proof of BosonicLearn.traceDist_le_one contains lemmas on nuclear expansions, their sums, and truncation to finite index sets.

Preamble
import Mathlib
import Definitions.Def_BosonicLearn_AdaptiveScheme
import Definitions.Def_BosonicLearn_sequentialLaw
open QAlgorithms.Papers.Independent.Dependency50.P33 (IsDensity)
open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

open MeasureTheory ProbabilityTheory
open scoped ENNReal Matrix
Formal statement
namespace BosonicLearn

/-- **An adaptive single-copy scheme is one POVM on the `N` copies.**
Chen, Anna Mele, Anna Mele, Preskill, *When are bosonic Gaussian states classical to learn?*, arXiv:2609.26705, §5.1, p. 30: "A non-entangled adaptive learning protocol on N copies can be specified by a family of
sequences of POVMs {M_{x_1}}, …, {M^{(x_{<t})}_{x_t}}, … Here, the t-th POVM can depend on the first t − 1
measurement outcomes x_{<t}"; the transcript likelihood is the product over rounds, Eq. (63), p. 35.

For every adaptive single-copy scheme `S` on `N` copies of an `n`-mode system with outcomes in `O`, there is one POVM
`M` on the `N`-copy Fock space `ℓ²(ℕⁿ)^{⊗N}` with outcomes in `O^N` (the transcripts) such that, for all density
operators `τ₁, …, τ_N` on one copy, the Born law of `M` on the product state `τ₁ ⊗ ⋯ ⊗ τ_N` is the law of the
transcript obtained when round `t` measures `τ_t`: the first outcome has law `S.round τ₁`, and given the first
`t − 1` outcomes `x_{<t}` the `t`-th outcome has law `S.round τ_t` at `x_{<t}`.

**Formalization Note.** The product state has entries `∏ₜ τₜ(uₜ, vₜ)` on the index type `Fin N → ℕⁿ`; with all `τₜ`
equal to `ρ` it is `ρ^{⊗N}` and the right-hand side is `transcriptLaw S ρ`. `M` is a `FockPOVM`, so its Born law is
a probability measure on every density of the `N`-copy space, entangled ones included. Non-identical factors are
allowed because that is the form in which the statement composes round by round. -/
theorem adaptive_scheme_product_povm {n N : ℕ} {O : Type} [MeasurableSpace O] (S : AdaptiveScheme n N O) :
    ∃ M : FockPOVM (Fin N → Occupation (Fin n)) (Fin N → O),
      ∀ τ : Fin N → Matrix (Occupation (Fin n)) (Occupation (Fin n)) ℂ, (∀ t, IsDensity (τ t)) →
        M.law (Matrix.of fun u v => ∏ t, τ t (u t) (v t)) =
          sequentialLaw (fun t => S.round (τ t) t) N le_rfl := by sorry

end BosonicLearn
Source
Chen, Anna Mele, Anna Mele, Preskill, When are bosonic Gaussian states classical to learn?, arXiv:2609.26705, §5.1, p. 30 ("A non-entangled adaptive learning protocol on N copies can be specified by a family of sequences of POVMs"); transcript likelihood Eq. (63), p. 35

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