Lemma 17
ProvedQAlgorithms.Papers.Independent.Gap20.P19.antidegradablePostprocessingAll 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.
Let be antidegradable and let be any channel. Then
The conclusion allows arbitrary nonzero finite dimensions and arbitrary CPTP postprocessing.
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]
/-- Lemma 17, PDF p.27: arbitrary CPTP postprocessing and dimensions. -/
theorem antidegradablePostprocessing [Nonempty A] [Nonempty B] [Nonempty C]
(Gamma : Superop A B) (Delta : Superop B C)
(hGamma : (∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = Gamma ∧ IsAntidegradable witness)) (hDelta : IsChannel Delta) :
(∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (Delta ∘ Gamma) ∧ IsAntidegradable witness) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, and let map complex matrices indexed by to those indexed by , while maps matrices indexed by to those indexed by . A channel means a map given by a finite family satisfying . Suppose is a channel, and there exist , a matrix , and a channel such that and, for every matrix indexed by ,
Then there exist , a matrix , and a channel such that and, for every ,
The environment sizes range over all natural numbers; the displayed isometry conditions exclude size zero because is nonempty.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.