Subadditivity with an entanglement-breaking factor
OpenQAlgorithms.Papers.Independent.Support50.P19.eb_subadditivityLet be an entanglement-breaking channel, let be any channel, and let . All spaces are finite-dimensional and nonzero. Then
The product channel is optimized over arbitrary joint mixed inputs, including entangled inputs. The second channel has no EB restriction. This is the subadditivity relation proved in the paper, without importing later superadditivity results.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P19
noncomputable section
open scoped Matrix ComplexOrder ComplexConjugate ENNReal
open Filter Topology
namespace QAlgorithms.Papers.Independent.Support50.P19
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Dependency50.P35
(tr Dominates spectralPower elog elogNN rawTrace cq)
open QAlgorithms.Papers.Independent.Dependency50.P09 (sandwichedD petzD relativeD)
open QAlgorithms.Papers.Independent.Information100.P56 (sandwichedTrace)
open QAlgorithms.Papers.Independent.Information100.P27 (average)
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel)
open QAlgorithms.Papers.Independent.Claimed50.P48 (FiniteKrausCP)
open QAlgorithms.Papers.Independent.Dependency50.P23
(UACode uaCodeSuccess ordinaryClassicalCapacity IsEB IsHadamard)
open QAlgorithms.Papers.Independent.Information100.P08 (Ensemble)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P63 (tensorPower)
open QAlgorithms.Papers.Independent.Claimed50.P26
(CovariantIrreducible minOutput UnassistedExponentialConverse)
variable {I J K L : Type} [Fintype I] [Fintype J] [Fintype K] [Fintype L]
variable [DecidableEq I] [DecidableEq J] [DecidableEq K] [DecidableEq L]
/-- PDF pp.20–21, Theorem 18: EB channel with an arbitrary channel partner; inequality only. -/
theorem eb_subadditivity [Nonempty I] [Nonempty J] [Nonempty K] [Nonempty L] (a : ℝ) (ha : 1 < a) (ha2 : a ≤ 2)
(N : Superop I J) (hN : IsChannel N) (hEB : IsEB N)
(M : Superop K L) (hM : IsChannel M) :
channelInformation true a (tensorChannel N M) ≤
channelInformation true a N + channelInformation true a M := by sorry
end QAlgorithms.Papers.Independent.Support50.P19
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty index types with decidable equality, let , and let and denote maps on complex matrix spaces, each admitting a finite Kraus representation with . Assume also that for every positive integer and every density matrix on , applying to each matrix block of gives a finite sum , where and are density matrices on the two respective factors; the definition imposes no separate normalization condition on these weights. Then
where is the linear map determined by . For any channel , is the extended-real supremum over all finite ensembles , with nonnegative weights summing to and density matrices , of , with ranging over output density matrices. A density matrix is positive semidefinite with complex trace , and zero ensemble weights are permitted. Here when ; otherwise it is
using spectral powers that send zero eigenvalues to and an extended logarithm equal to at zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.