Section 3.4: Lindblad dilation, Kraus isometry, and entropy preservation
OpenQAlgorithms.Papers.Independent.Intakethird100.P51.lindbladDilationEvery finite CPTP endomorphism on admits a finite auxiliary system , a unit vector and a unitary such that for every operator ,
For any finite normalized rectangular Kraus family , define . Then
For every density matrix , and have the same nonzero eigenvalues with multiplicity. Only the endomorphism clause asserts a unitary on a single space.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P51
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate Matrix.Norms.L2Operator
open MeasureTheory
namespace QAlgorithms.Papers.Independent.Intakethird100.P51
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact interfaces from the frozen accepted library; no local redeclarations.
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P56 (entropy holevo IsLaw)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy marginalAB channelAdjoint)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)
open QAlgorithms.Papers.Independent.Gap48.P33 (measurementInformation)
section Statements
variable {A B C D J K O : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype J] [Fintype K] [Fintype O]
variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]
variable [DecidableEq J] [DecidableEq K] [DecidableEq O]
/-- Section 3.4, equations (24)–(26), PDF pp.10–11: unitary endomorphism dilation
and rectangular Kraus isometry, with entropy and nonzero-spectrum preservation. -/
theorem lindbladDilation [Nonempty A] [Nonempty B] [Nonempty K] :
(∀ Phi : Superop A A, IsChannel Phi →
∃ m : ℕ, 0 < m ∧ ∃ beta : EuclideanSpace ℂ (Fin m), ‖beta‖ = 1 ∧
∃ U : Mat (A × Fin m), Uᴴ * U = 1 ∧ U * Uᴴ = 1 ∧
∀ X : Mat A, Phi X = traceRight (U * Matrix.kronecker X (pureDensity beta) * Uᴴ)) ∧
(∀ F : K → Matrix B A ℂ, IsKrausFamily F →
(krausV F)ᴴ * krausV F = 1 ∧
(∀ X : Mat A, traceRight (krausV F * X * (krausV F)ᴴ) = krausApply F X) ∧
(∀ rho : Mat A, IsDensityMatrix rho →
entropy (krausV F * rho * (krausV F)ᴴ) = entropy rho ∧
∀ z : ℂ, z ≠ 0 →
Module.finrank ℂ (Module.End.eigenspace (krausV F * rho * (krausV F)ᴴ).mulVecLin z) =
Module.finrank ℂ (Module.End.eigenspace rho.mulVecLin z))) := by sorry
end Statements
end QAlgorithms.Papers.Independent.Intakethird100.P51
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty index types , each with decidable equality, the following two assertions hold. First, every channel from complex matrices on to matrices on —meaning a map admitting a finite representation with —has a natural number , a Euclidean unit vector , and a matrix on satisfying , such that, for every complex matrix on ,
Second, for every family indexed by satisfying , define . Then , and for every complex matrix on . For every positive semidefinite on of trace , one also has , and, for every nonzero complex number , the complex dimensions of the -eigenspaces of and are equal. Here pure-density matrices have entries , partial traces sum over discarded indices, and for applied by continuous functional calculus using natural logarithms and . The eigenspace equality includes non-eigenvalues, for which both dimensions are zero, and makes no assertion about the zero eigenspaces.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.