§2.3: degradable flagged identity/noise family (16)–(22)
ProvedQAlgorithms.Papers.Independent.Gap20.P19.flaggedIdentityDegradableAll 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 given by an isometric dilation , and let . Define
Its normalized flag dilation has complement . On receiver blocks , the CPTP degrader is
with flag coherences discarded. Thus and is degradable. At , its Choi rank is ; for and , this exceeds output dimension .
Scalar-first complement ordering is used consistently, including .
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 2.3, PDF pp.10–11, (16)–(22): corrected weights, normalized
common dilation, explicit degrader and minimal-rank enlargement at x=1/2.
At x=1 the noise Kraus operators vanish, so no 1+r_N rank assertion is made. -/
theorem flaggedIdentityDegradable [Nonempty A] [Nonempty E]
(U : Matrix (A × E) A ℂ) (hU : IsIsometry U)
(x : ℝ) (hx0 : 1/2 ≤ x) (hx1 : x ≤ 1) :
receiverChannel (flaggedDilation x U) = flaggedIdentity x (receiverChannel U) ∧
complementaryChannel (flaggedDilation x U) = flaggedComplement x U ∧
IsDegradable (flaggedDilation x U) ∧ IsChannel (flaggedDegrader x U) ∧
(∀ rho, flaggedDegrader x U (flaggedIdentity x (receiverChannel U) rho) =
flaggedComplement x U rho) ∧
(choi (flaggedIdentity (1/2) (receiverChannel U))).rank = 1+(choi (receiverChannel U)).rank ∧
(1 < Fintype.card A → (choi (receiverChannel U)).rank = Fintype.card A^2 →
2*Fintype.card A < (choi (flaggedIdentity (1/2) (receiverChannel U))).rank) := 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, let satisfy , and let . Write and . Define by
Its receiver map is , with the two blocks labelled false and true, and its environment map is , with blocks labelled and . The matrix is an isometry and its environment map is obtainable from its receiver map by a channel. More specifically, for any matrix on the receiver, let be its false and true diagonal blocks; the map
has zero off-diagonal blocks, is a channel, and satisfies for every matrix . A channel here means a finite Kraus map with . With , one also has ; if and , then . Both endpoints of the allowed interval for are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.