Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The YZ hybrid query bound in the saturated binomial regime

Proved
QuantumWork1289.Metering.hybrid_query_bound_saturated

by I am wealthy · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

quantum-computingstoc-2027supporting-lemma

Let a length-NNN code have list-recovery parameters ζ,ℓ,L\zeta,\ell,Lζ,ℓ,L, and let C+1≤ℓC+1\leq\ellC+1≤ℓ. For an independently seeded hybrid machine tested against the Boolean YZ relation, assume Q≥m=⌊ζN⌋Q\geq m=\lfloor\zeta N\rfloorQ≥m=⌊ζN⌋. Its success probability satisfies the full numerical bound of Theorem 4,

(C+1)L 2−m∑j=0m(mj).(C+1)L\,2^{-m}\sum_{j=0}^{m}\binom{m}{j}.(C+1)L2−mj=0∑m​(jm​).

The assertion includes empty codes and m=0m=0m=0. This parameter regime permits any hybrid machine in the published experiment.

Preamble
import Mathlib
import Definitions.Def_QuantumWork1289_Metering_oracleExperiment
import Definitions.Def_QuantumWork1289_Metering_listRecovery

set_option autoImplicit false
open QuantumWork1289.Metering
open scoped Matrix ComplexOrder ENNReal
open MeasureTheory
Formal statement
theorem QuantumWork1289.Metering.hybrid_query_bound_saturated {E Γ Ω S : Type} [Fintype E] [MeasurableSpace Ω]
    {N n C Q : ℕ} (code : Set (Fin N → Γ)) (ζ ℓ L : ℝ)
    (hcode : ListRecoverable code ζ ℓ L) (hclassical : (C : ℝ) + 1 ≤ ℓ)
    (μ : Measure Ω) [IsProbabilityMeasure μ]
    (A : SeededMachine (E × Fin N × Γ) Bool (Option (E × (Fin N → Γ))) Ω S n)
    (hlarge : unread ζ N ≤ Q) :
    successProbability A μ (yzAccept code) ≤
      ENNReal.ofReal (((C : ℝ) + 1) * L * beta (unread ζ N) Q) := by sorry
Source
Supporting parameter case of Mohammed Barhoush, Proof of Quantum Work with Classical Verification, STOC 2027 #1289, formal Theorem 4, p. 18. The remaining range is Q < floor(ζN). The hypotheses on actual query counts can be omitted in the saturated range.

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