§II.C: PPT complement and the EB special case
OpenQAlgorithms.Papers.Independent.Support50.P01.complement_pptLet , , and have positive finite dimensions and fixed orthonormal bases. Fix an isometry and define the channel and its genuine complement . Density operators are positive semidefinite with trace one, and all entropies use base-two logarithms with . Write , , and , with arbitrary entangled block inputs. Conjugate degradability means one CPTP map satisfies for every operator ; conjugate antidegradability reverses the receiver and environment in this identity. If is conjugate degradable, then for every positive finite-dimensional reference and density operator ,
Furthermore, if is entanglement breaking, then is ordinarily degradable: one CPTP map satisfies . Entanglement breaking means that every reference-assisted density output is separable; it is not inferred from one separable output.
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 p.5: PPT complement for every reference; the EB special case implies ordinary degradability. -/
theorem complement_ppt (ha : 0<a) (hb : 0<b) (he : 0<e)
(U : Matrix (Fin b × Fin e) (Fin a) ℂ) (hU : ConjugateDegradable U) :
(∀ r : ℕ, 0<r → ∀ X : Matrix (Fin r × Fin a) (Fin r × Fin a) ℂ,
IsDensityMatrix X → (partialTransposeOutput (idTensorSuperop (complementaryChannel U) X)).PosSemidef) ∧
(EntanglementBreaking ha he (complementaryChannel U) → IsDegradable U) := by sorry
end QAlgorithms.Papers.Independent.Support50.P01
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers and every complex matrix , suppose and a channel satisfies for every matrix , where , , and a channel is a finite Kraus sum with . Then, for every positive natural number and every positive semidefinite trace-one matrix on , the matrix with entries
is positive semidefinite. In addition, if for every unit vector the blockwise image is a finite sum , where , , and every is positive semidefinite with trace one, then and there exists a finite Kraus channel satisfying for every matrix . The first assertion excludes ; the separable decompositions allow arbitrary finite , with unable to satisfy the weight-sum condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.