Theorem 19: partial-isometry mixing of Kraus representations
ProvedQAlgorithms.Papers.Independent.Gap48.P36.kraus_mixingAll Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. If is a minimal normalized Kraus family of size , then every rectangular with gives normalized representing the same channel. More generally, for any normalized families , let be the minimum Kraus number of the channel generated by . Then
The witness can also satisfy , as supplied by the source proof. No equality of family sizes is required.
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 19, PDF pp.30–31: isometric mixing from a minimal family, and the
rank-kappa rectangular partial-isometry iff for two normalized families. -/
theorem kraus_mixing [Nonempty A] [Nonempty B] [Nonempty K] [Nonempty L]
(F : K → Matrix B A ℂ) (G : L → Matrix B A ℂ)
(hF : IsKrausFamily F) (hG : IsKrausFamily G) :
(krausNumber (krausApply G) = Fintype.card L →
∀ U : Matrix K L ℂ, Uᴴ * U = 1 →
IsKrausFamily (fun j => ∑ k, U j k • G k) ∧
krausApply (fun j => ∑ k, U j k • G k) = krausApply G) ∧
(krausApply F = krausApply G ↔ ∃ W : Matrix K L ℂ,
PartialIsometry W ∧ Matrix.rank W = krausNumber (krausApply G) ∧
(∀ j, F j = ∑ k, W j k • G k) ∧ (∀ k, G k = ∑ j, conj (W j k) • F j)) := 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, and let be complex matrices from to , indexed respectively by , with and . Write and , and let be the infimum in the natural numbers of all for which matrices satisfy and for every matrix . The statement asserts both that, if , then every complex matrix satisfying gives matrices satisfying and ; and that
The first implication imposes no conclusion unless its numerical premise holds, and its universal assertion about is vacuous if no such isometry exists.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.