§6: optimized qq sum-information additivity
OpenQAlgorithms.Papers.Independent.Support50.P02.degradable_sum_additiveLet be a completely positive, trace-preserving channel between finite, positive-dimensional complex quantum registers. Alice and Bob control separate inputs. Codes use independent sender preparations, local encoders, one joint memoryless channel and one joint decoder, with external references untouched and no free shared resources. Fidelity is squared Uhlmann fidelity, trace distance is the full trace norm, and entropies are in bits. Write and for the closed operational classical–quantum and quantum–quantum capacity regions, using joint output fidelity and nonnegative rates.
For independent pure states and , let . Every information quantity in a fixed set of inequalities is evaluated on this same state. Here and is entropy in bits.
Suppose is degradable: for an isometric extension there is a CPTP map with , using the complement of that same extension. Define . For every positive integer ,
The optimization retains product inputs between senders and allows correlations across uses within either sender. This concerns the optimized information sum, not single-letterization of the full region.
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]
/-- Optimized qq sum-information additivity, PDF p.30, repeated uses of ONE
channel. Degradability uses the receiver and complement of the SAME dilation;
no joint entangled sender input or signed capacity conclusion is asserted. -/
theorem degradable_sum_additive [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty E]
(U : Matrix (C × E) (A × B) ℂ) (hU : IsDegradable U) (n : ℕ) (hn : 0 < n) :
optimizedSum (macPower (receiverChannel U) n) = (n : ℝ) * optimizedSum (receiverChannel U) := by sorry
end QAlgorithms.Papers.Independent.Support50.P02
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, and let be a complex matrix from to . Assume and that there is a channel such that, for every matrix on ,
Here a channel has a finite Kraus representation with . Define , and for any channel define
where references are grouped before inputs, , is the partial trace over both references, and with applied by continuous functional calculus. Then, for every natural number ,
where the block channel has inputs and output . In the supremum on the left, each sender’s unit vector may involve its whole block and an arbitrary positive reference dimension. The assertion excludes .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.