Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.11 — Dirty-channel Pauli overlap

Proved
RandomOracleUnitarySynthesis.synthesis_dirty_pauli_overlap

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

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

Fix a circuit, a Boolean function fff, and any unitary UUU on the nnn-qubit system. For PPP uniform over all 4n4^n4n phase-free Pauli operators, put Af,P=J†Wf†(P⊗I)WfJA_{f,P}=J^\dagger W_f^\dagger(P\otimes I)W_fJAf,P​=J†Wf†​(P⊗I)Wf​J. Then

EP1Ntr⁡(Af,PU†PU)≥1−D⋄(Ef,ΦU).\mathbb E_P\frac1N\operatorname{tr}(A_{f,P}U^\dagger P U)\ge1-D_\diamond(E_f,\Phi_U).EP​N1​tr(Af,P​U†PU)≥1−D⋄​(Ef​,ΦU​).

The channel EfE_fEf​ traces out garbage ancillas. The inequality uses its actual diamond distance and requires neither a synthesis coupling nor a prescribed error tolerance.

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: uniform finite expectations → normalized finite sums and genuine PMF expectations; reason: the truth-table and seed sets are finite and nonempty, so the sums equal the source expectations
  • 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: channels and their all-finite-reference diamond distance → matrix-unit channel coordinates and the literal mixed-state all-reference supremum; reason: coordinates identify the same linear maps and preserve the source distance including its factor one half
Preamble
import Definitions.Def_RandomOracleUnitarySynthesis_synthesis_circuit

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

theorem synthesis_dirty_pauli_overlap {n m m₀ k : ℕ}
    (C : synthesis_Circuit n m m₀ k) (f : synthesis_Oracle m₀) (U : synthesis_Unitary n) :
    1 - synthesis_diamond (synthesis_actualChannel C f) (synthesis_unitaryChannel U) ≤
      synthesis_average (fun P : synthesis_Pauli n =>
        synthesis_correlation (synthesis_observable C f P) P U) := by sorry

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