Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3, lines (33)–(34), p. 9 — the final sum is at most tr R(A(ρ)) ≤ 1

Proved
QReversal.NearOpt.eq_33_34

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

loewner-orderp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-channeltrace-inequality

Let A∼{Ai}i\mathcal A\sim\{A_i\}_iA∼{Ai​}i​ be trace-preserving, E={pl,ρl}lE=\{p_l,\rho_l\}_lE={pl​,ρl​}l​ an ensemble of commuting density matrices with ρ=∑lplρl\rho=\sum_lp_l\rho_lρ=∑l​pl​ρl​, R∼{Ri}i\mathcal R\sim\{R_i\}_iR∼{Ri​}i​ trace-nonincreasing (∑iRi†Ri≤I\sum_iR_i^\dagger R_i\le I∑i​Ri†​Ri​≤I) and B∼{Bj}j\mathcal B\sim\{B_j\}_jB∼{Bj​}j​ any family, indexed by the same set as R\mathcal RR, with B(ρ)≤A(ρ)\mathcal B(\rho)\le\mathcal A(\rho)B(ρ)≤A(ρ). Then

∑lpl∑i,jtr⁡RiBjρlBj†Ri†=∑lpltr⁡R(B(ρl))=tr⁡R(B(ρ))≤tr⁡R(A(ρ))≤1.\sum_lp_l\sum_{i,j}\operatorname{tr}R_iB_j\rho_lB_j^\dagger R_i^\dagger=\sum_lp_l\operatorname{tr}\mathcal R(\mathcal B(\rho_l))=\operatorname{tr}\mathcal R(\mathcal B(\rho))\le\operatorname{tr}\mathcal R(\mathcal A(\rho))\le1 .l∑​pl​i,j∑​trRi​Bj​ρl​Bj†​Ri†​=l∑​pl​trR(B(ρl​))=trR(B(ρ))≤trR(A(ρ))≤1.

This closes the bound (27)–(34) that the proof of Theorem 3 needs in line (23).

Formalization Note The page prints the last step as tr⁡R(A(ρ))=1\operatorname{tr}\mathcal R(\mathcal A(\rho))=1trR(A(ρ))=1. After the replacement Ri↦PCRiR_i\mapsto P_CR_iRi​↦PC​Ri​ in the proof, R\mathcal RR is only trace-nonincreasing, so the correct step is ≤1\le1≤1, which is what is stated. The paper uses lll-dependent decompositions RilR^l_iRil​, BjlB^l_jBjl​ of the same maps R\mathcal RR, B\mathcal BB in (32); since (33) depends only on the maps, the statement uses one decomposition of each. Traces of positive semidefinite matrices are real and are taken as real parts.

Preamble
import Mathlib
import Definitions.Def_PeresTerno_kraus_basics
import Definitions.Def_QReversal_NearOpt_Setting

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

theorem eq_33_34 {n L ι κ : Type*} [Fintype n] [DecidableEq n] [Fintype L] [Fintype ι]
    [Fintype κ]
    (A : ι → Matrix n n ℂ) (hA : IsTracePreserving A)
    (p : L → ℝ) (ρs : L → Matrix n n ℂ) (hE : IsCommutingEnsemble p ρs)
    (ρ : Matrix n n ℂ) (hρ : ρ = avgState p ρs)
    (R B : κ → Matrix n n ℂ) (hR : IsTraceNonincreasing R)
    (hBA : krausUpdate B ρ ≤ krausUpdate A ρ) :
    ∑ l, p l * ∑ i, ∑ j, (Matrix.trace (R i * B j * ρs l * (B j)ᴴ * (R i)ᴴ)).re =
        ∑ l, p l * (Matrix.trace (krausUpdate R (krausUpdate B (ρs l)))).re ∧
      ∑ l, p l * (Matrix.trace (krausUpdate R (krausUpdate B (ρs l)))).re =
        (Matrix.trace (krausUpdate R (krausUpdate B ρ))).re ∧
      (Matrix.trace (krausUpdate R (krausUpdate B ρ))).re ≤
        (Matrix.trace (krausUpdate R (krausUpdate A ρ))).re ∧
      (Matrix.trace (krausUpdate R (krausUpdate A ρ))).re ≤ 1 := by sorry

end QReversal.NearOpt
Source
Barnum, Knill, Reversing quantum dynamics with near-optimal quantum and classical fidelity, arXiv:quant-ph/0004088v2, p. 9, proof of Theorem 3, lines (33)–(34)
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