§7.3: input concavity of coherent information
ProvedQAlgorithms.Papers.Independent.Support50.P02.degradable_concavityLet be an isometry of finite, positive-dimensional complex registers. Write and for its receiver channel and complement. Suppose a CPTP map satisfies . Define , with entropy in bits. For density operators and ,
This is concavity in the input state of a fixed degradable channel, including both endpoints.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P02
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Support50.P02
open QAlgorithms.Papers.Independent.Information100.P67
(squaredFidelity receiverChannel complementaryChannel IsDegradable)
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Dependency50.P19 (epr)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C E R S I J : Type*}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype E] [DecidableEq E]
variable [Fintype R] [DecidableEq R] [Fintype S] [DecidableEq S]
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
/-- Concavity in the INPUT of a degradable channel, §7.3, PDF p.35.
This is distinct from background convexity in the channel at fixed input (p.4). -/
theorem degradable_concavity [Nonempty A] [Nonempty B] [Nonempty E]
(U : Matrix (B × E) A ℂ) (hU : IsDegradable U)
(rho0 rho1 : Op A) (h0 : IsDensityMatrix rho0) (h1 : IsDensityMatrix rho1)
(lambda : ℝ) (hl0 : 0 ≤ lambda) (hl1 : lambda ≤ 1) :
lambda * inputCoherent U rho0 + (1 - lambda) * inputCoherent U rho1 ≤
inputCoherent U ((lambda : ℂ) • rho0 + ((1 - lambda : ℝ) : ℂ) • rho1) := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For arbitrary nonempty finite types , each with decidable equality, let be a complex matrix from to satisfying . Suppose there is a map from -indexed matrices to -indexed matrices with a finite Kraus representation , , such that for every -indexed complex matrix ,
For every pair of positive semidefinite -indexed matrices with complex trace equal to , and every real , the assertion is
where and for the continuous functional calculus of . The partial traces sum the diagonal indices of the indicated subsystem. The endpoints and the case are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.