Lemma 12: a channel from a bounded entanglement witness
OpenQAlgorithms.Papers.Independent.Intakethird100.P19.witnessMap_duallyNonEntanglingAll Hilbert spaces are finite-dimensional complex spaces with fixed product bases and positive local dimensions. States are positive semidefinite operators of trace one; pure kets have norm one. Let be Hermitian and satisfy for every separable state, and let be its Frobenius norm. Define and
Then is a channel and both and its trace dual preserve the separable positive cone.
This is the witness conversion construction used for distillability.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P19
noncomputable section
open QAlgorithms QAlgorithms.Entanglement Filter
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
namespace QAlgorithms.Papers.Independent.Intakethird100.P19
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P19 (Bip)
open QAlgorithms.Papers.Independent.Information100.P69 (CP)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
/-- Lemma 12, PDF pp.16-17: every witness of Frobenius norm at most one
constructs the specified dually non-entangling channel of Eq.(21). -/
theorem witnessMap_duallyNonEntangling {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
(W : Bip a b) (hw : Witness W) (hnorm : frobenius W ≤ 1) :
IsChannel (witnessMap W) ∧ DNE (witnessMap W) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all positive natural numbers , let be a Hermitian matrix on satisfying for every separable positive matrix , and suppose . Here separable positive matrices are finite nonnegative sums of tensor products of positive semidefinite trace-one matrices, including the empty sum. Put and , where . Then the map is a channel, and both and its trace-bilinear dual are non-entangling. Explicitly, the channel condition supplies a finite Kraus representation with ; each non-entangling condition requires a finite Kraus representation, without a normalization requirement, and preservation of the separable positive cone. The dual is defined by . Zero witnesses and one-dimensional input factors are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.