Lemma 2: closure under CPTP postprocessing
ProvedQAlgorithms.Papers.Independent.Support50.P01.conjugateAnti_postprocessLet be positive finite-dimensional complex spaces with fixed bases. Suppose is a conjugate antidegradable channel: it has a common isometric dilation and complement and one CPTP map satisfying on every operator. For any CPTP map ,
The conclusion allows the complement of the composed dilation and a new CPTP witness. No unitality or inverse-channel assumption is imposed.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P01
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF pp.13–14, Lemma 2: postprocessing by any CPTP map; no unitality condition.
The proof's Eq.(36) reverses Kraus order; trace preservation uses sum E_k†E_k=I. -/
theorem conjugateAnti_postprocess (ha : 0<a) (hb : 0<b) (hc : 0<c)
(Phi : Superop (Fin a) (Fin b)) (Delta : Superop (Fin b) (Fin c))
(hPhi : ConjugateAntiChannel Phi) (hDelta : IsChannel Delta) :
ConjugateAntiChannel (Delta ∘ Phi) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be positive natural numbers, and let map complex matrices to matrices and map matrices to matrices. Suppose there exist a positive natural number , a matrix with , and a finite Kraus map such that, for every complex input matrix ,
Suppose also that is a finite Kraus map. Here a finite Kraus map from dimension to dimension means a map , for some natural number , with of size and . Then there exist a positive natural number , a matrix with , and a finite Kraus map such that, for every ,
All transposes are ordinary transposes, and the partial traces remove the indicated output factor.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.