Theorem A.10: For CP-unital phi:Y→X,psi:X→A and Tr phi(B)≤Tr B for positive B, H(psi∘phi)≥H(psi).
ProvedQAlgorithms.Papers.Independent.Renew46.P43.entropyIncreaseFix a normalized ambient state. Let and be CP-unital Heisenberg operations, with for every positive . Define . Composition reverses the physical state-map order; compatibility is not assumed.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Theorem A.10, PDF pp.70-71: composition reverses state-map order. No
compatibility assumption is needed for these composable quantum operations. -/
theorem entropyIncrease {Y X A : IntrinsicSystem} (F : IntrinsicOperation Y X) (G : IntrinsicOperation X A)
(htrace : TraceNonincreasing F) (rho : Matrix (Fin A.dim) (Fin A.dim) ℂ)
(hrho : A.IsState rho) :
viewedEntropy Y (G.map.comp F.map) rho ≥ viewedEntropy X G.map rho := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be systems with positive finite dimensions and natural number block labels on their basis indices, and call a matrix block diagonal if its entries vanish between different labels. Let be a complex linear map from matrices on to matrices on , and a complex linear map from matrices on to matrices on . Assume that both maps preserve the identity and block diagonality and that, at every finite amplification size , applying the map to each matrix block preserves positive semidefiniteness for inputs whose entries vanish between different source block labels. Assume further that every positive semidefinite block diagonal matrix on satisfies . Let be a positive semidefinite block diagonal matrix on with trace . Define matrices and by
where and are the respective matrix units. Then
where and is applied by continuous functional calculus.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.