Proof of Theorem 3, (14)–(15), p. 7 — restricting R to the support of ρ and the bound B(ρ) ≤ A(ρ)
ProvedQReversal.NearOpt.eq_14_15loewner-orderp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1petz-recoveryquantum-channel
Let be an ensemble of commuting density matrices with average , and let be such that has full support. Let be trace-preserving and the projector onto the support of . Put
with the generalized inverse square root. Then:
- replacing by does not change the average entanglement fidelity: ;
- is trace-nonincreasing: ;
- (14) for every ;
- (15) , where .
These are the opening reductions of the proof of Theorem 3: every recovery is rewritten in the same shape as the reversal operation, with in place of , and the inequality (15) is what bounds the final sum in (34).
Formalization Note need not be trace-preserving. Part 1 needs no commutation; the commuting-ensemble hypothesis is the standing assumption of Theorem 3. Part 3 uses the full support of .
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_14_15 {n L ι κ : Type*} [Fintype n] [DecidableEq n] [Fintype L] [Fintype ι]
[Fintype κ]
(A : ι → Matrix n n ℂ) (p : L → ℝ) (ρs : L → Matrix n n ℂ)
(hE : IsCommutingEnsemble p ρs) (ρ : Matrix n n ℂ) (hρ : ρ = avgState p ρs)
(hfull : (krausUpdate A ρ).PosDef)
(R : κ → Matrix n n ℂ) (hR : IsTracePreserving R) :
let R' : κ → Matrix n n ℂ := fun k => supportProj ρ * R k
let B : κ → Matrix n n ℂ := fun k => CFC.sqrt (krausUpdate A ρ) * (R' k)ᴴ * invSqrt ρ
Fbar p ρs (comp R' A) = Fbar p ρs (comp R A) ∧
IsTraceNonincreasing R' ∧
(∀ k, R' k = CFC.sqrt ρ * (B k)ᴴ * invSqrt (krausUpdate A ρ)) ∧
krausUpdate B ρ ≤ krausUpdate A ρ := by sorry
end QReversal.NearOpt
Source
Barnum, Knill, Reversing quantum dynamics with near-optimal quantum and classical fidelity, arXiv:quant-ph/0004088v2, p. 7, proof of Theorem 3, (14)–(15)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.