p. 4: a linear map is CPTP iff its CJ matrix satisfies and
ProvedOCB2012.cptp_iff_cjLet be a linear map between operators on finite-dimensional spaces, and let be its Choi–Jamiołkowski matrix (p. 3). Then is completely positive and trace preserving if and only if
The paper uses this equivalence on p. 4 ("Since a map is CPTP if and only if its CJ operator satisfies…") to turn the normalization of probabilities into condition (5). It is why the whole mission may represent local operations directly by their CJ matrices. The direction "completely positive " and its converse together make up Choi's theorem.
Formalization Note. Complete positivity is PeresTerno.IsCompletelyPositive: is positive for every finite ancilla dimension . Trace preservation is required for all matrices, which is equivalent to requiring it for all states by linearity.
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_OCB2012_defs import Definitions.Def_OCB2012_cj open Matrix open scoped Kronecker ComplexOrder
namespace OCB2012
theorem cptp_iff_cj {x1 x2 : Type*} [Fintype x1] [Fintype x2] [DecidableEq x1] [DecidableEq x2]
(Φ : Matrix x1 x1 ℂ →ₗ[ℂ] Matrix x2 x2 ℂ) :
(PeresTerno.IsCompletelyPositive Φ ∧ IsTracePreserving Φ) ↔ IsCPTP_CJ (cjMatrix Φ) := by sorry
end OCB2012