Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (38): diagonal and off-diagonal trace sums

Proved
QReversal.PGMBound.eq_38

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

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

Write ρj=pjρ^j\rho_j=p_j\hat\rho_jρj​=pj​ρ^​j​ and ρout=∑jρj\rho_{\mathrm{out}}=\sum_j\rho_jρout​=∑j​ρj​. For the classicizing channel and its reversal, with full-support output,

Fcl(ρ,RA,ρA)=∑jtr⁡(ρout−1/2ρjρout−1/2ρj)=1−∑i≠jtr⁡(ρout−1/2ρiρout−1/2ρj).F_{\mathrm{cl}}(\rho,R_{A,\rho}A) =\sum_j\operatorname{tr}(\rho_{\mathrm{out}}^{-1/2}\rho_j\rho_{\mathrm{out}}^{-1/2}\rho_j) =1-\sum_{i\ne j}\operatorname{tr}(\rho_{\mathrm{out}}^{-1/2}\rho_i\rho_{\mathrm{out}}^{-1/2}\rho_j).Fcl​(ρ,RA,ρ​A)=j∑​tr(ρout−1/2​ρj​ρout−1/2​ρj​)=1−i=j∑​tr(ρout−1/2​ρi​ρout−1/2​ρj​).

The second form expresses recovery failure as overlap between distinct ensemble members.

Formalization Note Only the second and third lines of (38) are asserted. The first line involving the squared optimum conflicts with Corollary 4.

Preamble
import Mathlib
import Definitions.Def_QReversal_PGMBound_Setting

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

theorem eq_38 {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) :
    Fcl p (comp (reversal (classicKraus lam v) (rho p)) (classicKraus lam v)) =
      ∑ j, (Matrix.trace
        (QReversal.NearOpt.invSqrt (rhoOut p lam v) * weightedState p lam v j *
         QReversal.NearOpt.invSqrt (rhoOut p lam v) * weightedState p lam v j)).re ∧
    Fcl p (comp (reversal (classicKraus lam v) (rho p)) (classicKraus lam v)) =
      1 - ∑ i, ∑ j, if i = j then 0 else
        (Matrix.trace
          (QReversal.NearOpt.invSqrt (rhoOut p lam v) * weightedState p lam v i *
           QReversal.NearOpt.invSqrt (rhoOut p lam v) * weightedState p lam v j)).re := by sorry

end QReversal.PGMBound
Source
Barnum, Knill, Reversing quantum dynamics with near-optimal quantum and classical fidelity, arXiv:quant-ph/0004088v2, p. 11, (38), second and third lines
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