Proposition 17: complete preservation and Choi classes
OpenQAlgorithms.Papers.Independent.Intakethird100.P19.completePreservation_characterizationAll 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 and let be any completely positive map from to an arbitrary positive-dimensional bipartite register. Trace preservation is not assumed. Then both chains hold:
The -preservation conditions amplify by the identity on a -dimensional ancilla at each party; complete preservation quantifies over all .
This identifies the completely preserving classes with their grouped Choi classes.
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)
/-- Proposition 17, PDF pp.20-21: both respectively branches, for CP maps
without trace preservation. The local input dimension d=1 is included. -/
theorem completePreservation_characterization {d a b : ℕ}
(hd : 0 < d) (ha : 0 < a) (hb : 0 < b)
(L : Superop (Fin d × Fin d) (Fin a × Fin b)) (hcp : CP L) :
((SEP L ↔ KNE d L) ∧ (KNE d L ↔ CompleteNE L)) ∧
((ChoiPPT L ↔ KPPT d L) ∧ (KPPT d L ↔ CompletePPT L)) := 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 and every map from operators on to operators on having a finite Kraus representation , without any trace-preservation requirement, the following equivalences hold: has a separable positive party-grouped Choi matrix if and only if its amplification by a -dimensional auxiliary system on each party is non-entangling, and this is equivalent to its amplification being non-entangling for every positive auxiliary dimension ; likewise, its party-grouped Choi matrix and that matrix’s first partial transpose are both positive semidefinite if and only if its amplification by -dimensional auxiliaries preserves positive-partial-transpose matrices, and this is equivalent to that preservation property for every positive auxiliary dimension . Precisely, the grouped Choi entries are , and the amplification acts by
A non-entangling map has a finite Kraus representation and preserves every separable positive matrix, meaning every finite nonnegative sum of tensor products of positive semidefinite trace-one matrices, including . Positive-partial-transpose preservation requires a finite Kraus representation and preservation of the set of matrices for which both and are positive semidefinite, where . Each fixed- condition also explicitly requires and a finite Kraus representation for ; the complete conditions quantify over all positive , excluding .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.