Remark 1: partial traces and global additivity
OpenQAlgorithms.Papers.Independent.Gap48.P46.partial_trace_scopeAll quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel , write for the maximum ensemble Holevo information at mean , for the minimum average output entropy at that mean, and for the maximum of over a nonempty closed mean constraint . The constraint includes every joint density with first marginal in and second marginal in , including correlated and entangled states.
Unconstrained chi-capacity additivity holds for every pair of partial-trace channels. Moreover, if additivity holds for every pair of finite-dimensional partial-trace channels with every nonempty closed marginal constraint pair, then it holds for every pair of unconstrained channels:
Both clauses of the remark compare the scope of additivity assertions; constrained additivity is not asserted unconditionally.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap48.P46
open scoped Matrix ComplexConjugate ENNReal ComplexOrder
open Filter
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)
open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)
open QAlgorithms.Papers.Independent.Dependency50.P23 (IsEB)
open QAlgorithms.Papers.Independent.Information100.P08
(Ensemble ensembleAverage outputHolevo mixedRoof)
variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]
variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]
/-- PDF p.8, Remark 1: unconstrained partial-trace additivity, and the implication
from globally constrained partial-trace additivity to global unconstrained additivity. -/
theorem partial_trace_scope [Nonempty I] [Nonempty O] [Nonempty J] [Nonempty K] :
ConstrainedAdditive (traceRight : Superop (I × O) I) (traceRight : Superop (J × K) J)
(states (I × O)) (states (J × K)) ∧
(PartialTraceConstrained → GlobalUnconstrained) := by sorry
end QAlgorithms.Papers.Independent.Gap48.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality. For a finite type , write for its positive semidefinite trace-one matrices. For a channel , put , where is the supremum of over all finite density-matrix ensembles with nonnegative weights summing to and average ; here , with zero terms equal to . For channels , write ; their tensor map is the linear extension of . First, for on and on ,
Second, suppose that for every four finite nonempty types with decidable equality, their two corresponding partial-trace maps satisfy this capacity equality for every pair of nonempty closed subsets of their respective input density matrices, without requiring convexity. Then every pair of channels between any finite nonempty types with decidable equality satisfies
The channels in this conclusion range over all maps with finite Kraus representations whose adjoint-products sum to the identity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.