Proof of Theorem 3, lines (33)–(34), p. 9 — the final sum is at most tr R(A(ρ)) ≤ 1
ProvedQReversal.NearOpt.eq_33_34loewner-orderp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-channeltrace-inequality
Let be trace-preserving, an ensemble of commuting density matrices with , trace-nonincreasing () and any family, indexed by the same set as , with . Then
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 . After the replacement in the proof, is only trace-nonincreasing, so the correct step is , which is what is stated. The paper uses -dependent decompositions , of the same maps , 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.