§4.2, equation (10): intrinsic Kraus formula
ProvedQAlgorithms.Papers.Independent.Support50.P41.krausFidelityLet be a density matrix on a nonzero finite-dimensional system, any normalized purification, and a fixed normalized operator-sum representation. Then
This expresses fidelity intrinsically and gives the same value for every normalized Kraus representation.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF p.15, (10): scalar trace conjugation in the intrinsic Kraus formula. -/
theorem krausFidelity {d a m : ℕ} [NeZero d]
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
(psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
(Phi : Superop (Fin d) (Fin d)) (A : Fin m → Matrix (Fin d) (Fin d) ℂ)
(hA : OperatorSum Phi A) :
purificationFidelity psi Phi = ∑ k, Complex.normSq ((rho * A k).trace) := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be integers. Let be positive semidefinite with trace one, and let have norm one and satisfy . Let be a function from to itself, and suppose matrices satisfy and for every matrix . Then
where applies to each block with fixed reference row and column. The hypotheses are impossible when , because must be a unit vector, or when , because the empty completeness sum cannot equal .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.