Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5, proved reading: PGM error bounded by weighted Bures–Uhlmann overlaps

Proved
QReversal.PGMBound.theorem_5

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

bures-uhlmann-fidelityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pretty-good-measurementquantum-information

Let (pj,ρ^j)(p_j,\hat\rho_j)(pj​,ρ^​j​) be a finite ensemble of density matrices with spectral decompositions ρ^j=∑iλij∣vij⟩⟨vij∣\hat\rho_j=\sum_i\lambda_{ij}|v_{ij}\rangle\langle v_{ij}|ρ^​j​=∑i​λij​∣vij​⟩⟨vij​∣. Let Aij=λij∣vij⟩⟨j∣A_{ij}=\sqrt{\lambda_{ij}}|v_{ij}\rangle\langle j|Aij​=λij​​∣vij​⟩⟨j∣, ρ=∑jpj∣j⟩⟨j∣\rho=\sum_jp_j|j\rangle\langle j|ρ=∑j​pj​∣j⟩⟨j∣, and suppose A(ρ)A(\rho)A(ρ) has full support. Then

Fcl(ρ,RA,ρA)≥1−∑i≠jpipj FBU(ρ^i,ρ^j).F_{\mathrm{cl}}(\rho,R_{A,\rho}A) \geq 1-\sum_{i\ne j}\sqrt{p_ip_j}\, F_{\mathrm{BU}}(\hat\rho_i,\hat\rho_j).Fcl​(ρ,RA,ρ​A)≥1−i=j∑​pi​pj​​FBU​(ρ^​i​,ρ^​j​).

The sum is over ordered pairs, counting every distinct unordered pair twice. The result bounds the pretty good measurement's error for mixed-state ensembles.

Formalization Note Equation (39) prints Fcl2F_{\mathrm{cl}}^2Fcl2​, where FclF_{\mathrm{cl}}Fcl​ means optimal success probability. Its preceding (38) reverses Corollary 4's comparison. Pages 12–13 prove the displayed bound for Fcl(ρ,RA,ρA)F_{\mathrm{cl}}(\rho,R_{A,\rho}A)Fcl​(ρ,RA,ρ​A), which is the form posed here. The generalized inverse and full-support assumption follow page 7.

Preamble
import Mathlib
import Definitions.Def_QReversal_PGMBound_Setting

open Matrix PeresTerno
open scoped MatrixOrder ComplexOrder
Formal statement
namespace QReversal.PGMBound

theorem theorem_5 {J O : Type*} [Fintype J] [DecidableEq J]
    [Fintype O] [DecidableEq O]
    (p : J → ℝ) (lam : O → J → ℝ) (v : O → J → O → ℂ)
    (hp : IsProbability p) (hs : IsSpectralData lam v)
    (hfull : (rhoOut p lam v).PosDef) :
    1 - ∑ i, ∑ j, (if i = j then 0 else
      Real.sqrt (p i * p j) * FBU (rhoHat lam v i) (rhoHat lam v j)) ≤
    Fcl p (comp (reversal (classicKraus lam v) (rho p)) (classicKraus lam v)) := by sorry

end QReversal.PGMBound
Source
Barnum, Knill, Reversing quantum dynamics with near-optimal quantum and classical fidelity, arXiv:quant-ph/0004088v2, pp. 11–13, Theorem 5 (39), proved reading
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

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