Proof of Theorem 3, lines (28)–(32), p. 9 — the trace Cauchy–Schwarz step
ProvedQReversal.NearOpt.eq_29_32cauchy-schwarzmatrix-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-channel
Let be weights and density matrices, and let , be arbitrary finite families of matrices indexed by the same set, for each . Then
This is the chain (28)–(32): the Cauchy–Schwarz inequality for the Hilbert–Schmidt inner product, , and the addition of the non-negative terms . In the proof of Theorem 3 the left side bounds the normalization factor needed in line (23).
Formalization Note The traces on the right are of positive semidefinite matrices, hence real; the statement takes their real parts. The families are arbitrary, so the statement does not depend on the singular-value choices made earlier in the proof.
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_29_32 {n L κ : Type*} [Fintype n] [Fintype L] [Fintype κ]
(p : L → ℝ) (hp : ∀ l, 0 ≤ p l) (ρs : L → Matrix n n ℂ)
(hρs : ∀ l, IsDensityMatrix (ρs l))
(Rl Bl : L → κ → Matrix n n ℂ) :
∑ l, p l * ∑ i, Complex.normSq (Matrix.trace (ρs l * Rl l i * Bl l i)) ≤
∑ l, p l * ∑ i, ∑ j,
(Matrix.trace (Rl l i * Bl l j * ρs l * (Bl l j)ᴴ * (Rl l i)ᴴ)).re := 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 (28)–(32)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.