Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1, p. 7 — unit vectors within Euclidean distance ε give measurement distributions within total variation 4ε

Proved
BBBV.RandomOracle.theorem_3_1

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

measurementp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationtotal-variation

Let ι\iotaι be a finite set and let u,v∈Cιu, v \in \mathbb{C}^{\iota}u,v∈Cι be unit vectors, ∥u∥=∥v∥=1\|u\| = \|v\| = 1∥u∥=∥v∥=1, with Euclidean distance ∥u−v∥≤ε\|u - v\| \le \varepsilon∥u−v∥≤ε. Measuring uuu in the computational basis gives the outcome ccc with probability ∣uc∣2|u_c|^2∣uc​∣2, and likewise for vvv. Then the total variation distance between the two outcome distributions satisfies

∑c∈ι∣ ∣uc∣2−∣vc∣2 ∣≤4ε.\sum_{c \in \iota} \bigl|\, |u_c|^2 - |v_c|^2 \,\bigr| \le 4\varepsilon .c∈ι∑​​∣uc​∣2−∣vc​∣2​≤4ε.

The theorem converts a bound on the distance between two superpositions into a bound on the difference of any observable probability, in particular of acceptance probabilities; it is the step from the hybrid argument (Theorem 3.3) to a statement about what an algorithm outputs.

Formalization Note The total variation distance is the paper's footnote 7, ∑x∣D(x)−D′(x)∣\sum_x |\mathcal D(x) - \mathcal D'(x)|∑x​∣D(x)−D′(x)∣, without the factor 1/21/21/2. The constant 444 is the paper's; it is not sharp.

Preamble
import Mathlib
Formal statement
namespace BBBV.RandomOracle

theorem theorem_3_1 {ι : Type} [Fintype ι] (u v : EuclideanSpace ℂ ι) (hu : ‖u‖ = 1)
    (hv : ‖v‖ = 1) (ε : ℝ) (h : ‖u - v‖ ≤ ε) :
    ∑ c, |‖u c‖ ^ 2 - ‖v c‖ ^ 2| ≤ 4 * ε := by sorry

end BBBV.RandomOracle
Source
Bennett, Bernstein, Brassard and Vazirani, Strengths and weaknesses of quantum computing, arXiv:quant-ph/9701001v1, p. 7, Theorem 3.1 and footnotes 6–7
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