§5.1, equations (13)–(14): exchange-matrix entropy
ProvedQAlgorithms.Papers.Independent.Support50.P41.exchangeMatrixEntropyLet be a density matrix and a normalized operator-sum representation of a channel . Construct
Then is a density matrix and , with entropy in bits. This computes entropy exchange using only the input and Kraus operators.
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 pp.20--21, (13)--(14): computed exchange matrix and its entropy, with the printed order.
Source correction: the first p.20 formula for rho_E prints Tr_E; use Tr_RQ,
as in the immediately following derivation. Independent moderation pending. -/
theorem exchangeMatrixEntropy {d m : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (A : Fin m → Matrix (Fin d) (Fin d) ℂ)
(hA : OperatorSum Phi A)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
(∀ k l, complementaryMap A rho k l = (A k * rho * (A l)ᴴ).trace) ∧
IsDensityMatrix (complementaryMap A rho) ∧
entropyExchange Phi rho = vnEntropy (complementaryMap 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 and be integers. Let be a function, and suppose matrices satisfy and for every . Let be positive semidefinite with trace one. Define entrywise by
Then for every , is positive semidefinite with trace one, and , where for the spectral function , , and has coefficients in the fixed enumeration of the input basis. The amplification applies to each system block. Although is quantified over, it cannot satisfy the completeness equality when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.