Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.6 — expected query magnitude of a later sampled string

Proved
BBBV.RandomPermutation.expected_queryMag_le

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-query-complexityquery-magnituderandom-permutation

In the hybrid computation, let ψi\psi_iψi​ be the state before query step iii. If i≤j≤T+1i\le j\le T+1i≤j≤T+1, then the string xjx_jxj​ sampled by the chain has expected query magnitude at most the reciprocal of the number of length-nnn binary strings:

E[qxj(ψi)]≤2−n.\mathbb E[q_{x_j}(\psi_i)]\le 2^{-n}.E[qxj​​(ψi​)]≤2−n.

This bound applies to the random string xjx_jxj​, including j=ij=ij=i, and is the independence estimate needed for the hybrid comparison.

Formalization Note Expectation is a finite average over the explicit chain sample space. At i=0i=0i=0, the initial state is fixed and x0x_0x0​ is uniform.

Preamble
import Mathlib
import Definitions.Def_BBBV_RandomPermutation_Chain
Formal statement
namespace BBBV.RandomPermutation

theorem expected_queryMag_le {n T : ℕ} {W : Type} [Fintype W]
    (M : QueryAlg (BBBV.RandomOracle.Str n) (BBBV.RandomOracle.Str n) W T) (i : Fin T) (j : ℕ)
    (hij : (i : ℕ) ≤ j) (hj : j ≤ T + 1) :
    avg (fun ω : Ω n T => queryMag (x ω j) (state M (hybrid ω) i)) ≤
      1 / (2 : ℝ) ^ n := by sorry

end BBBV.RandomPermutation
Source
Bennett, Bernstein, Brassard and Vazirani, Strengths and weaknesses of quantum computing, arXiv:quant-ph/9701001v1, p. 11, proof of Theorem 3.6, paragraph beginning 'We claim'
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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