§7: qutrit nondegradable channels arbitrarily near identity
OpenQAlgorithms.Papers.Independent.Gap20.P19.nearIdentityNeitherAll Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.
Set for and
on qutrits. Every is CPTP, has Choi rank three, and is neither degradable nor antidegradable. Also , and for every matrix unit and every output entry , .
This makes the source's arbitrarily-near-identity conclusion precise by entrywise convergence, without inventing a diamond-distance constant.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P19
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker
open Filter Topology
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
maximumCoherentInformation dilationPower)
open QAlgorithms.Papers.Independent.Claimed50.P48
(MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)
open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)
open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)
open QAlgorithms.Papers.Independent.Information100.P69 (choi)
open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E F R K A2 B2 E2 : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype E] [DecidableEq E] [Nonempty E]
variable [Fintype F] [DecidableEq F] [Nonempty F]
variable [Fintype R] [DecidableEq R] [Nonempty R]
variable [Fintype K] [DecidableEq K]
variable [Fintype A2] [DecidableEq A2] [Nonempty A2]
variable [Fintype B2] [DecidableEq B2] [Nonempty B2]
variable [Fintype E2] [DecidableEq E2] [Nonempty E2]
/-- Section 7, PDF p.23: an explicit sequence of rank-three qutrit channels,
neither class, converging entrywise on all matrix units to the identity. -/
theorem nearIdentityNeither :
let eps : ℕ → ℝ := fun n => 1/((n : ℝ)+4)
let N : ℕ → Superop (Fin 3) (Fin 3) := fun n => threeWeyl (1-2*eps n) (eps n) (eps n)
(∀ n, IsChannel (N n) ∧ (choi (N n)).rank = 3 ∧
¬ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (N n) ∧ IsDegradable witness) ∧ ¬ (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (N n) ∧ IsAntidegradable witness)) ∧
Tendsto (fun n => 2*eps n) atTop (nhds 0) ∧
(∀ i j k l : Fin 3, Tendsto (fun n => N n (Matrix.single i j 1) k l)
atTop (nhds ((Matrix.single i j 1 : Matrix (Fin 3) (Fin 3) ℂ) k l))) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , set and define the map on complex matrices
where and . Each is a channel, meaning it has a finite Kraus representation with , and its Choi matrix has rank . There is no natural number and matrix whose receiver map is and which is degradable; nor is there such a which is antidegradable. Here the receiver and complementary maps are and ; degradability requires and a channel satisfying on every matrix, while antidegradability requires and a channel satisfying on every matrix. The quantified environment size includes , although that size cannot support such an isometry. Furthermore, , and for all ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.