Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 (Shadow Tomography Theorem) — Õ(log(1/δ) log⁴M log D/ε⁵) copies estimate all Tr(E_iρ) to ±ε

Proved
ShadowTomography.UpperBound.theorem_2

by mikedeng1 · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-state-learningsample-complexityshadow-tomography

Shadow tomography. Let ρ\rhoρ be an unknown DDD-dimensional mixed state and E1,…,EME_1,\dots,E_ME1​,…,EM​ known two-outcome measurements. The task is to output numbers b1,…,bM∈[0,1]b_1,\dots,b_M\in[0,1]b1​,…,bM​∈[0,1] with ∣bi−Tr(Eiρ)∣≤ε|b_i-\mathrm{Tr}(E_i\rho)|\le\varepsilon∣bi​−Tr(Ei​ρ)∣≤ε for all iii, with success probability at least 1−δ1-\delta1−δ, via a measurement of ρ⊗k\rho^{\otimes k}ρ⊗k with k=k(D,M,ε,δ)k=k(D,M,\varepsilon,\delta)k=k(D,M,ε,δ) as small as possible.

Theorem. There is a universal constant C>0C>0C>0 such that for all D≥0D\ge0D≥0, M≥2M\ge2M≥2, 0<ε≤1/20<\varepsilon\le1/20<ε≤1/2 and 0<δ≤1/20<\delta\le1/20<δ≤1/2 there is a number of copies

k≤C log⁡Dε(log⁡log⁡D+log⁡1εε2)2log⁡4M (log⁡log⁡M+log⁡log⁡D+log⁡1ε+log⁡1δ)k \le C\,\frac{\log D}{\varepsilon}\left(\frac{\log\log D+\log\frac1\varepsilon}{\varepsilon^2}\right)^{2}\log^4 M\,\Big(\log\log M+\log\log D+\log\frac1\varepsilon+\log\frac1\delta\Big)k≤CεlogD​(ε2loglogD+logε1​​)2log4M(loglogM+loglogD+logε1​+logδ1​)

with the following property: for every list of two-outcome measurements E1,…,EME_1,\dots,E_ME1​,…,EM​ on CD\mathbb C^DCD there is a measurement of ρ⊗k\rho^{\otimes k}ρ⊗k, together with outputs b1,…,bM∈[0,1]b_1,\dots,b_M\in[0,1]b1​,…,bM​∈[0,1] for each outcome, such that for every DDD-dimensional mixed state ρ\rhoρ,

Pr⁡[ ∣bi−Tr(Eiρ)∣≤ε for all i∈[M] ] ≥ 1−δ.\Pr\big[\,|b_i-\mathrm{Tr}(E_i\rho)|\le\varepsilon\ \text{for all } i\in[M]\,\big]\ \ge\ 1-\delta .Pr[∣bi​−Tr(Ei​ρ)∣≤ε for all i∈[M]] ≥ 1−δ.

The bound is O~(log⁡(1/δ)ε5log⁡4Mlog⁡D)\tilde O\big(\frac{\log(1/\delta)}{\varepsilon^5}\log^4M\log D\big)O~(ε5log(1/δ)​log4MlogD): polylogarithmic in both the number of measurements and the dimension.

Formalization Note This is the explicit bound of the last display of the proof of Theorem 2 (p. 19), i.e. the ε−5\varepsilon^{-5}ε−5 form proved in §5; the printed ε−4\varepsilon^{-4}ε−4 form of p. 3 relies on an external online-learning algorithm and is not stated. Quantifier order: CCC first; kkk depends only on (D,M,ε,δ)(D,M,\varepsilon,\delta)(D,M,ε,δ); the measurement and outputs depend on the EiE_iEi​ but not on ρ\rhoρ. Added hypotheses: M≥2M\ge2M≥2 (at M=1M=1M=1, log⁡M=0\log M=0logM=0 forces k=0k=0k=0, and no zero-copy output estimates one nontrivial Tr(E1ρ)\mathrm{Tr}(E_1\rho)Tr(E1​ρ) to within 1/41/41/4), ε≤1/2\varepsilon\le1/2ε≤1/2 and δ≤1/2\delta\le1/2δ≤1/2 (they keep both log⁡log⁡\log\logloglog-containing factors positive; for ε≥1/2\varepsilon\ge1/2ε≥1/2 outputting 1/21/21/2 is trivially correct). No hypothesis on DDD is needed: D=0D=0D=0 has no state and at D=1D=1D=1 the state is known. All logarithms are natural (Real.log), including inside log⁡log⁡\log\logloglog. The measurement is a POVM with a finite outcome type, and "probability" is the Born-rule probability of the success event.

Preamble
import Mathlib
import Definitions.Def_WildeQIT_IsDensityOperator
import Definitions.Def_ShadowTomography_UpperBound_IsEffect
import Definitions.Def_ShadowTomography_UpperBound_tensorPow
import Definitions.Def_ShadowTomography_UpperBound_POVM

open scoped ComplexOrder
Formal statement
namespace ShadowTomography.UpperBound

/-- **Theorem 2 (Shadow Tomography Theorem), in the explicit form proved in §5.** There is a
universal constant `C` such that for all `D`, `M ≥ 2`, `0 < ε ≤ 1/2` and `0 < δ ≤ 1/2` there is a
number of copies
`k ≤ C (log D/ε) ((log log D + log(1/ε))/ε²)² log⁴ M (log log M + log log D + log(1/ε) + log(1/δ))`
such that for every list of two-outcome measurements `E 0, …, E (M-1)` on `ℂ^D` there is a
measurement of `ρ^{⊗k}` (independent of `ρ`) whose outcome yields numbers `b_i ∈ [0, 1]` with
`|b_i - Tr(E_i ρ)| ≤ ε` for all `i` simultaneously, with probability at least `1 - δ`, for every
`D`-dimensional mixed state `ρ`. -/
theorem theorem_2 :
    ∃ C : ℝ, 0 < C ∧
      ∀ (D M : ℕ) (ε δ : ℝ), 2 ≤ M → 0 < ε → ε ≤ 1 / 2 → 0 < δ → δ ≤ 1 / 2 →
        ∃ k : ℕ, (k : ℝ) ≤ C * (Real.log D / ε) *
            ((Real.log (Real.log D) + Real.log (1 / ε)) / ε ^ 2) ^ 2 * Real.log M ^ 4 *
            (Real.log (Real.log M) + Real.log (Real.log D) + Real.log (1 / ε) +
              Real.log (1 / δ)) ∧
          ∀ E : Fin M → Matrix (Fin D) (Fin D) ℂ, (∀ i, IsEffect (E i)) →
            ∃ (Ω : Type) (_ : Fintype Ω) (P : POVM Ω (Fin k → Fin D)) (b : Ω → Fin M → ℝ),
              (∀ ω i, b ω i ∈ Set.Icc (0 : ℝ) 1) ∧
              ∀ ρ : Matrix (Fin D) (Fin D) ℂ, WildeQIT.IsDensityOperator ρ →
                1 - δ ≤ P.prob (tensorPow ρ k)
                  (fun ω => ∀ i, |b ω i - ((E i) * ρ).trace.re| ≤ ε) := by sorry

end ShadowTomography.UpperBound
Source
Aaronson, Shadow Tomography of Quantum States, arXiv:1711.01053v2, p. 2, Problem 1; p. 3, Theorem 2; p. 15, restatement in §5; p. 19, last display of the proof of Theorem 2
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 4, 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