§5.1, equation (15): attained minimum over Kraus representations
ProvedQAlgorithms.Papers.Independent.Support50.P41.minimumOutcomeEntropyFor a density matrix and CPTP map on a nonzero finite-dimensional system, every countably indexed normalized operator-sum representation gives probabilities satisfying
The Shannon entropy may be infinite. Some finite Kraus representation attains equality, so the bound is an attained minimum over representations. The minimizing representation may depend on .
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF p.21, (15): lower bound for all countable Kraus representations and an attaining finite representation; no infimum default. -/
theorem minimumOutcomeEntropy {d : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
(∀ (K : Type) [Countable K] (A : K → Matrix (Fin d) (Fin d) ℂ),
CountableOperatorSum Phi A →
ENNReal.ofReal (entropyExchange Phi rho) ≤
countableEntropy (fun k => (A k * rho * (A k)ᴴ).trace.re)) ∧
∃ m : ℕ, ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
OperatorSum Phi A ∧ entropyExchange Phi rho = outcomeEntropy A rho := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let admit a finite representation for every , with , and let be positive semidefinite with trace one. Put , where has coefficients in the fixed enumeration of the input basis, the amplification applies to each system block, and for the spectral function , with . For every countable type and every family such that the matrix sums and converge respectively to and for every , set . Then, in ,
where , and the right side may be infinite. Moreover, there exist an integer and matrices with and for every , for which , with . Neither an empty countable family nor can satisfy the completeness condition.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.