Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.13 — Haar trace-correlation tail

Proved
RandomOracleUnitarySynthesis.synthesis_haar_trace_tail

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

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

Let AAA be any fixed Hermitian contraction on nnn qubits and QQQ any nonidentity phase-free Pauli operator. For every t≥0t\ge0t≥0 and Haar-random U∈U(2n)U\in U(2^n)U∈U(2n),

Pr⁡ ⁣[1Ntr⁡(AU†QU)≥t]≤exp⁡ ⁣(−N2t248).\Pr\!\left[\frac1N\operatorname{tr}(AU^\dagger Q U)\ge t\right]\le\exp\!\left(-\frac{N^2t^2}{48}\right).Pr[N1​tr(AU†QU)≥t]≤exp(−48N2t2​).

This is a one-sided estimate with ordinary unnormalized trace inside the displayed normalization. No separate mean-zero condition is imposed on AAA.

Differences from the source:

  • encoding: binary computational bases and the phase-free Pauli family → Fin n → Fin 2 bases and Fin n → Fin 4 labels for tensor products of I, X, Y, Z; reason: these are bijective finite encodings of the source basis and all 4ⁿ phase-free Paulis, with the zero label equal to identity
  • 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
Preamble
import Definitions.Def_RandomOracleUnitarySynthesis_synthesis_circuit

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

theorem synthesis_haar_trace_tail (n : ℕ) (A : synthesis_Mat n)
    (hA : A.IsHermitian) (hcontract : synthesis_IsContraction A)
    (Q : synthesis_Pauli n) (hQ : Q ≠ (fun _ => 0)) (t : ℝ) (ht : 0 ≤ t) :
    (synthesis_haar n) {U | t ≤ synthesis_correlation A Q U} ≤
      ENNReal.ofReal (Real.exp (-((2 : ℝ)^n)^2 * t^2 / 48)) := by sorry

end RandomOracleUnitarySynthesis
Source
Andrew Huang, Akshar Ramkumar, John Wright, STOC 2027 submission #157 (October 2026), Lemma 4.13, printed p. 30 (PDF p. 32); https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/157.pdf#page=32; 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