§5.2, equations (16)–(17) and absolute-value summary
ProvedQAlgorithms.Papers.Independent.Support50.P41.systemEntropyBoundsprove2quantum
For a density matrix and CPTP map on a nonzero finite-dimensional system, write . Then
All entropies are in bits. The lower bound covers entropy decrease as well as increase.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
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 pp.23--24, (16)--(17) and summary: both signs of system entropy change are bounded. -/
theorem systemEntropyBounds {d : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
|vnEntropy (Phi rho) - vnEntropy rho| ≤ entropyExchange Phi rho ∧
entropyExchange Phi rho ≤ vnEntropy rho + vnEntropy (Phi rho) := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 24, §5.2, equations (16)–(17) and absolute-value summary
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , every map admitting a finite representation with , and every positive semidefinite with trace , define , where , , and matrix functions use continuous functional calculus; define , where . Then both inequalities hold:
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.