§4.1: purification independence of entanglement fidelity
ProvedQAlgorithms.Papers.Independent.Support50.P41.intrinsicFidelityFix a finite-dimensional CPTP map and density matrix . Any normalized purifications and of , on possibly different finite reference spaces, give
Moreover the output corresponding to is for every reference unitary , where . Thus fidelity is intrinsic to and .
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 pp.13--14, (9): purification independence across reference dimensions, with unitary covariance. -/
theorem intrinsicFidelity {d a b : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
(psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
(phi : EuclideanSpace ℂ (Fin b × Fin d)) (hphi : IsPurification rho phi) :
purificationFidelity psi Phi = purificationFidelity phi Phi ∧
∀ U : Matrix.unitaryGroup (Fin a) ℂ,
idTensorSuperop Phi (pureDensity
(act (Matrix.kronecker (U : Matrix (Fin a) (Fin a) ℂ)
(1 : Matrix (Fin d) (Fin d) ℂ)) psi)) =
conjSuperop (Matrix.kronecker (U : Matrix (Fin a) (Fin a) ℂ)
(1 : Matrix (Fin d) (Fin d) ℂ)) (idTensorSuperop Phi (pureDensity psi)) := 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 complex linear, trace preserving on all matrices, and completely positive, meaning that every blockwise amplification , including , preserves positive semidefiniteness. Let be positive semidefinite with trace one, and let unit vectors and satisfy , where the partial trace sums entries over equal reference indices. For a vector with reference dimension , define . Then , and every unitary satisfies
The amplification applies to each system block. The purification hypotheses cannot hold if or .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.