Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.12 — Haar correlation net

Proved
RandomOracleUnitarySynthesis.synthesis_haar_correlation_net

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

p2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationquery-complexityrandom-oracles

There is an absolute B>0B>0B>0 such that every admissible synthesis family with a(n)=1−ε(n)a(n)=1-\varepsilon(n)a(n)=1−ε(n) and N(n)2a(n)→+∞N(n)^2a(n)\to+\inftyN(n)2a(n)→+∞ has, for all sufficiently large nnn, a finite nonempty set TTT of Hermitian contractions and a nonidentity Pauli operator QQQ satisfying

log⁡2∣T∣≤BNk2a4,Pr⁡U∼Haar ⁣[max⁡A∈T1Ntr⁡(AU†QU)≥a8]≥a8.\log_2|T|\le B\frac{Nk^2}{a^4},\qquad \Pr_{U\sim\mathrm{Haar}}\!\left[\max_{A\in T}\frac1N\operatorname{tr}(AU^\dagger Q U)\ge\frac a8\right]\ge\frac a8.log2​∣T∣≤Ba4Nk2​,U∼HaarPr​[A∈Tmax​N1​tr(AU†QU)≥8a​]≥8a​.

Both TTT and QQQ are fixed before drawing UUU. The statement retains the expected-channel coupling and the complete near-one-error regime.

Differences from the source:

  • encoding: binary computational bases, Boolean truth tables, and the stated register inequalities → Fin n → Fin 2 bases, Bool-valued truth tables, and a circuit type carrying n ≤ m and m₀ ≤ m; reason: these are bijective finite encodings of exactly the source registers and functions
  • encoding: ω and O/Ω notation for synthesis algorithms → eventually quantified families, N²(1−ε) → +∞, and an absolute positive constant before all family parameters; reason: this spells out the source asymptotic quantifiers and permits arbitrary ancilla growth
  • encoding: minimum or maximum over a finite operator set → a nonempty Finset and equivalent universal or existential membership events; reason: finite nonemptiness ensures attainment and avoids default values of real extrema or log cardinality
  • encoding: ordinary real trace of products of Hermitian operators → the real part of the ordinary complex trace; reason: conjugating and cycling the trace proves its reality without adding a hypothesis
  • encoding: probability for a normalized Haar random full complex unitary → evaluation of Borel Haar probability with ENNReal.ofReal thresholds; reason: the measure is an actual probability and all thresholds are nonnegative in the stated domain
  • encoding: a nonnegative expected diamond-distance bound in a joint channel distribution → a probability coupling on Borel channel coordinates and a nonnegative Lebesgue integral; reason: it preserves arbitrary dependence and the exact two channel marginals without Bochner-integral defaults
Preamble
import Definitions.Def_RandomOracleUnitarySynthesis_synthesis_family

open scoped Matrix ComplexConjugate
open MeasureTheory Filter Classical
noncomputable section
Formal statement
namespace RandomOracleUnitarySynthesis

theorem synthesis_haar_correlation_net :
    ∃ B : ℝ, 0 < B ∧ ∀ (m m₀ k : ℕ → ℕ)
      (C : (n : ℕ) → synthesis_Circuit n (m n) (m₀ n) (k n)) (ε : ℕ → ℝ),
      synthesis_Admissible m m₀ k C ε → synthesis_GapRegime ε →
      ∀ᶠ n : ℕ in atTop, ∃ T : Finset (synthesis_Mat n), T.Nonempty ∧
        (∀ A ∈ T, A.IsHermitian ∧ synthesis_IsContraction A) ∧
        Real.logb 2 (T.card : ℝ) ≤ B * (2 : ℝ)^n * (k n : ℝ)^2 / (1-ε n)^4 ∧
        ∃ Q : synthesis_Pauli n, Q ≠ (fun _ => 0) ∧
          ENNReal.ofReal ((1-ε n)/8) ≤ (synthesis_haar n)
            {U | ∃ A ∈ T, (1-ε n)/8 ≤ synthesis_correlation A Q U} := by sorry

end RandomOracleUnitarySynthesis
Source
Andrew Huang, Akshar Ramkumar, John Wright, STOC 2027 submission #157 (October 2026), Lemma 4.12, printed p. 28 (PDF p. 30); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/157.pdf#page=30; PDF SHA256 2f2d7fa67fe2665257ec12cb0d11d7e2a80752cdecc0484b26a311d1223c5d11
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 10, 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