Theorem 20: strict hierarchy of k-non-entangling maps
OpenQAlgorithms.Papers.Independent.Intakethird100.P19.kNonEntangling_strictHierarchyAll 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. For every , there exists a completely positive map from to two qubits such that
Each nontrivial adjacent level of the hierarchy is distinct.
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)
/-- Theorem 20, PDF pp.22-23: strictness of each k-non-entangling level,
for CP maps from d-by-d to two qubits; TP is not a hypothesis. -/
theorem kNonEntangling_strictHierarchy (k d : ℕ) (hk : 2 ≤ k) (hkd : k < d) :
∃ L : Superop (Fin d × Fin d) (Fin 2 × Fin 2),
CP L ∧ KNE k L ∧ ¬ KNE (k + 1) 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 every pair of natural numbers , there exists a map from matrices on to matrices on having a finite Kraus representation , such that adjoining a -dimensional identity system to each party makes preserve separable positive operators, whereas adjoining a -dimensional identity system to each party does not. Explicitly, the amplified map acts on blocks by
It preserves the separable positive cone for , and there exists an operator in that cone whose image lies outside the corresponding cone for . A separable positive operator is a finite sum with nonnegative weights and positive semidefinite trace- factors; empty sums are allowed and the weights need not sum to . No trace-preservation requirement is imposed on .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.