Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.6 — random permutation query lower bound for the first inverse bit

Proved
BBBV.RandomPermutation.theorem_3_6

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

lower-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-query-complexityrandom-permutation

Let n≥1n\ge1n≥1, and let MMM be any finite-dimensional quantum query algorithm making TTT queries to a permutation of the length-nnn binary strings. For a permutation AAA, ask whether the first bit of A−1(1n)A^{-1}(1^n)A−1(1n) is 111. If T≤2n/3/100T\le 2^{n/3}/100T≤2n/3/100, then

Pr⁡A uniform[M does not decide this bit with error at most 1/3]≥18.\Pr_{A\text{ uniform}}[M\text{ does not decide this bit with error at most }1/3]\ge\frac18.A uniformPr​[M does not decide this bit with error at most 1/3]≥81​.

The probability is over all (2n)!(2^n)!(2n)! permutations; the algorithm and its finite workspace are fixed before the permutation is sampled. This is the finite-length lower bound in the proof of the paper's almost-sure oracle separation.

Formalization Note The statement uses the query model rather than a full oracle quantum Turing machine. Answers at lengths other than nnn are fixed and absorbed into the inter-query unitaries. The hypothesis n≥1n\ge1n≥1 makes the first bit defined. The paper's constants 1/1001/1001/100 and 1/81/81/8 are kept. The almost-sure statement over countably many machines is outside this mission's Lean goal. One full-value oracle query can be simulated by nnn Boolean queries, while one Boolean query can be simulated by two full-value queries, so the lower bound transfers to the paper's Boolean oracle with a constant adjustment.

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

open Classical

theorem theorem_3_6 (n : ℕ) (hn : 0 < n) (W : Type) [Fintype W] (T : ℕ)
    (hT : (T : ℝ) ≤ (2 : ℝ) ^ ((n : ℝ) / 3) / 100)
    (M : QueryAlg (BBBV.RandomOracle.Str n) (BBBV.RandomOracle.Str n) W T) :
    (1 / 8 : ℝ) ≤
      ((Finset.univ.filter fun A : Equiv.Perm (BBBV.RandomOracle.Str n) =>
          ¬ Decides M (fun _ => ⇑A) (firstBit hn (A.symm (BBBV.RandomOracle.ones n)) = 1)).card : ℝ) /
        (Fintype.card (Equiv.Perm (BBBV.RandomOracle.Str n)) : ℝ) := by sorry

end BBBV.RandomPermutation
Source
Bennett, Bernstein, Brassard and Vazirani, Strengths and weaknesses of quantum computing, arXiv:quant-ph/9701001v1, p. 10, Theorem 3.6 and finite claim (proof pp. 10–12)
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