§7.4: convexity of both capacity regions
OpenQAlgorithms.Papers.Independent.Support50.P02.capacity_convexLet 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 either or , any and any satisfy
Thus both full operational capacity regions are convex. No extra convex-hull operation is added to the regularized capacity descriptions.
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]
/-- Convexity of BOTH full operational capacity regions, §7.4, PDF p.35,
announced p.8. Convexification is not inserted into any capacity formula. -/
theorem capacity_convex [Nonempty A] [Nonempty B] [Nonempty C]
(N : Superop (A × B) C) (hN : IsChannel N) :
Convex ℝ (cqMacCapacity N) ∧ Convex ℝ (qqMacCapacity N) := 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, and every map from complex matrices on to complex matrices on admitting a finite Kraus representation with , both its classical–quantum generation region and its quantum–quantum generation region are convex subsets of . Each region is defined as the closure of the nonnegative pairs for which every admits such that every has positive message or reference dimensions , with and , and a generation protocol of error at most . In the classical–quantum case such a protocol consists of unit vectors on , one for every , a unit vector on a -dimensional reference and , and a decoding channel from to an -dimensional classical output and a -dimensional output; its requirement is
where is obtained by applying independently to the input pairs, decoding while retaining the reference, and setting entries between different classical output labels to zero. In the quantum–quantum case the inputs are independent unit vectors on an -dimensional reference and , and on a -dimensional reference and ; a decoding channel from to dimensions must produce, with the references retained, a matrix satisfying . Every decoding channel has a finite Kraus representation with the same completeness condition. Here is the projector onto , and , using continuous functional calculus. Convexity means that for either of these closed regions, any two points in it and any real with have in that same region.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.