Proposition 21: rank-three detector channels are not 3-non-entangling
OpenQAlgorithms.Papers.Independent.Intakethird100.P19.rankThreeMap_notThreeNonEntanglingAll registers are finite-dimensional complex spaces with positive local dimensions and fixed product bases. Let and , and let be the Werner state. For every unit ket of Schmidt rank three such that , construct
Then is a channel, is dually non-entangling, has PPT grouped Choi operator, sends to an LOCC-distillable two-qubit state, and is not -non-entangling. Dually non-entangling means that the channel and its trace dual preserve the separable positive cone; -non-entangling tests preservation after adjoining a three-dimensional identity ancilla at each party. LOCC-distillability is trace-norm convergence of deterministic LOCC outputs on tensor powers to .
The same conclusions are also explicitly recorded for the canonical detector in the first three local coordinates.
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 21, PDF p.23: the Eq.(21) channels for every unit
Schmidt-rank-three detector of the Werner state are not 3-NE. The rank
and negative pairing specify the detector used in the source proof; all
channel, preservation and distillability properties remain conclusions.
The canonical equal-amplitude detector is also recorded explicitly. -/
theorem rankThreeMap_notThreeNonEntangling (d : ℕ) (hd : 3 ≤ d)
(beta : ℝ) (hlo : ((d : ℝ) - 3) / 3 < beta)
(hhi : beta ≤ ((d : ℝ) - 2) / 2) :
(IsChannel (rankThreeMap d) ∧ DNE (rankThreeMap d) ∧ ChoiPPT (rankThreeMap d) ∧
LOCCDistillable (rankThreeMap d (betaWernerState d beta)) ∧ ¬ KNE 3 (rankThreeMap d)) ∧
∀ eta : UnitBipartiteKet d d, finiteSchmidtRank eta.ket = 3 →
(betaWernerState d beta * partialTransposeFirst eta.rho).trace.re < 0 →
let L := witnessMap (partialTransposeFirst eta.rho)
IsChannel L ∧ DNE L ∧ ChoiPPT L ∧
LOCCDistillable (L (betaWernerState d beta)) ∧ ¬ KNE 3 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 natural number and every real number satisfying , the following assertions hold. Use basis indices for , write for a matrix unit, and write for the matrix with entries . For a bipartite matrix, define its partial transpose on the first factor by . Let exchange the two factors, so its -entry is when and , and otherwise, and put
For any matrix on , define the map to matrices on by
Here a density matrix means a positive semidefinite matrix of trace ; a separable positive matrix means any finite sum , where is a natural number, every , and every is a density matrix, with no requirement that the weights sum to ; the empty sum is allowed and equals zero. A map is a channel when it has a finite Kraus representation with . Say that a map has the separability-preserving property when it has a finite Kraus representation, without a completeness requirement, and sends every separable positive matrix to a separable positive matrix. Its trace-bilinear dual is the map defined by , with no complex conjugation in this pairing. For a map from the bipartite system to , define its party-grouped Choi matrix by
The Choi condition used here means that has a finite Kraus representation and that both and its partial transpose on the grouped factor are positive semidefinite. The property with index that is excluded below means that has a finite Kraus representation and that its extension by a three-dimensional identity system on each party has the separability-preserving property across ; explicitly, this extension satisfies
where . Finally, call a bipartite matrix distillable here when it is a density matrix and there exists a sequence of channels , each realizable by the following finite recursive local construction, such that as : the construction starts with identity maps and permits either party to apply a finite complete local Kraus family and then, for each Kraus outcome, continue with another map in the construction, summing the resulting branches. More explicitly, an Alice step has the form , with , and a Bob step uses instead; local dimensions and the finite number of outcomes are natural numbers, including zero where the required equations permit it. The copies are grouped by party and indexed using the fixed bijections between strings of basis indices and their finite index sets, and . With these meanings, is a channel, both it and its trace-bilinear dual have the separability-preserving property, it satisfies the Choi condition, its output on is distillable, and it does not have the property with index . Moreover, for every unit vector , let . If exactly three eigenvalues of the reduced matrix , counted with multiplicity, are strictly positive, and
then is a channel, both it and its trace-bilinear dual have the separability-preserving property, it satisfies the Choi condition, its output on is distillable, and it does not have the property with index .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.