Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Non-adaptive purity estimation: tight copy complexity

Open
IncoherentPurity.Adaptive.Supplement.nonadaptive_copy_complexity

by mikedeng1 · Nov 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationstatistics

A non-adaptive incoherent protocol measures each fresh copy separately, chooses its entire POVM schedule before seeing outcomes, and may use shared classical randomness. It succeeds if, for every ddd-dimensional state ρ\rhoρ, its estimate obeys ∣P^−tr⁡(ρ2)∣≤εtr⁡(ρ2)|\widehat P-\operatorname{tr}(\rho^2)|\le\varepsilon\operatorname{tr}(\rho^2)∣P−tr(ρ2)∣≤εtr(ρ2) with probability at least 2/32/32/3.

There exist absolute constants c,C,ε0>0c,C,\varepsilon_0>0c,C,ε0​>0 and an integer d0>1d_0>1d0​>1 such that, for every d≥d0d\ge d_0d≥d0​ and 0<ε≤ε00<\varepsilon\le\varepsilon_00<ε≤ε0​, writing B(d,ε)=max⁡{d/ε2,d3/2/ε}B(d,\varepsilon)=\max\{d/\varepsilon^2,d^{3/2}/\varepsilon\}B(d,ε)=max{d/ε2,d3/2/ε},

some successful non-adaptive protocol uses N≤CB(d,ε),every successful non-adaptive protocol uses N≥cB(d,ε).\begin{aligned}&\text{some successful non-adaptive protocol uses }N\le C B(d,\varepsilon),\\&\text{every successful non-adaptive protocol uses }N\ge c B(d,\varepsilon).\end{aligned}​some successful non-adaptive protocol uses N≤CB(d,ε),every successful non-adaptive protocol uses N≥cB(d,ε).​

Both statements allow arbitrary measurable POVM outcomes and the published shared-seed protocol model. The constants and thresholds are chosen before dimension, precision, budget or protocol. This companion theorem supplies the full non-adaptive characterization alongside the adaptive goal.

Differences from the source:

  • encoding: Theta of the maximum rate → uniform positive constants and thresholds with operational existence and universal lower clauses; reason: this spells out both sides of the source asymptotic claim without changing any regime
  • encoding: d to the power three halves → (d : real) times sqrt d; reason: these agree for every positive dimension
Preamble
import Definitions.Def_IncoherentPurity_Adaptive_Supplement_Spike

open MeasureTheory ProbabilityTheory Matrix
open scoped ENNReal
set_option autoImplicit false
noncomputable section
Formal statement
namespace IncoherentPurity.Adaptive.Supplement

/-- Theorem 1.2, PDF = printed p.4; pinned source SHA-256 7d80a6695c9c0b12bfa088a8f47d2a298b93f9fde9668867acfb4a95b19f03ce. -/
theorem nonadaptive_copy_complexity : ∃ (c C ε₀ : ℝ) (d₀ : ℕ),
  0 < c ∧ 0 < C ∧ 0 < ε₀ ∧ 1 < d₀ ∧
  ∀ d : ℕ, d₀ ≤ d → ∀ ε : ℝ, 0 < ε → ε ≤ ε₀ →
    (∃ (N : ℕ) (P : Protocol d), IsNonadaptive P ∧ Succeeds P N ε ∧
      (N : ℝ) ≤ C * max ((d : ℝ)/ε^2) ((d : ℝ)*Real.sqrt d/ε)) ∧
    (∀ (N : ℕ) (P : Protocol d), IsNonadaptive P → Succeeds P N ε →
      c * max ((d : ℝ)/ε^2) ((d : ℝ)*Real.sqrt d/ε) ≤ (N : ℝ)) := by sorry

end IncoherentPurity.Adaptive.Supplement
Source
Lee–Wadhwa, Optimal Purity Estimation with Incoherent Measurements, STOC 2027 submission #66 (2026), preprint, pinned source.pdf; https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/66.pdf; SHA-256 7d80a6695c9c0b12bfa088a8f47d2a298b93f9fde9668867acfb4a95b19f03ce; Theorem 1.2, PDF p.4 = printed p.4

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