Theorem 17: conjugate-channel linearization identities
ProvedQAlgorithms.Papers.Independent.Gap48.P36.conjugate_linearizationAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Fix a normalized Kraus family , defining , and an integer , and set . Define with cyclic indices. Let , and with the computed Hilbert–Schmidt adjoint. Then
These are operator identities on the full input tensor power; the adjoint is retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P36
open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal
open QAlgorithms.Papers.Independent.Claimed50.P48
open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)
open QAlgorithms.Papers.Independent.Information100.P50 (schattenNorm)
open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)
open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C D E K L A2 B2 C2 : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]
variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]
/-- Theorem 17, PDF pp.26–27, (79): retain the adjoint of the conjugate linearizer.
The cyclic convention is fixed by L_p|k1,...,kp>=|k2,...,kp,k1>. -/
theorem conjugate_linearization [Nonempty A] [Nonempty B] [Nonempty K]
(F : K → Matrix B A ℂ) (hF : IsKrausFamily F) (p : ℕ) (hp : 1 ≤ p) :
channelLinearizer (krausApply F) p = (krausLinearizer (rowKraus F) p)ᴴ ∧
channelLinearizer (krausApply F) p = krausLinearizer F p * leftCycle A p := by sorry
end QAlgorithms.Papers.Independent.Gap48.P36
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, let be complex matrices with rows indexed by and columns by , and suppose . Let be a natural number and define . For any finite index type , let , indexed by , have entry at exactly when for every , and otherwise. Define the trace-dual map by , and define entrywise by
For a family of matrices with input index , define
where indexes that family, and define the reshuffled family , with rows indexed by , by . Then
These assertions include .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.