Section IV.A: private capacity of the two-Kraus qubit family
OpenQAlgorithms.Papers.Independent.Support50.P07.twoKraus_privateCapacityFor , let have Kraus matrices and . Then
The maximum is attained, including in the antidegradable regime.
All quantum registers are finite and nonzero, states have trace one, pure vectors have norm one, and entropy and logarithms are in bits. Operational private capacities use memoryless powers, positive blocklengths and message counts, uniform messages, arbitrary mixed block inputs, and normalized decoding POVMs. A code is good when its joint decoded message/environment state has full trace norm less than the error from a perfectly correlated uniform pair tensor its actual common environment marginal. Rates use every positive error and rate slack at all sufficiently large blocklengths. Symmetric assistance allows one arbitrary finite symmetric channel per block without charging its dimension.
This result supplies a capacity identity or bound for the channel family and resource model stated above.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P07
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
namespace QAlgorithms.Papers.Independent.Support50.P07
open QAlgorithms.Papers.Independent.Information100.P67
(IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
dilationPower idealJoint maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Claimed50.P24 (productDilation)
open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation)
variable {A B E C D F : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype E] [DecidableEq E] [Fintype C] [DecidableEq C]
variable [Fintype D] [DecidableEq D] [Fintype F] [DecidableEq F]
/-- Section IV.A, PDF p.6: optimized formula for all physical two-Kraus parameters,
including the antidegradable regime. The existential t records the printed MAX, not just a supremum. -/
theorem twoKraus_privateCapacity [Nonempty E]
(U : Matrix (Fin 2 × E) (Fin 2) ℂ)
(hU : IsIsometry U) (gamma delta : ℝ)
(hg : gamma ∈ Set.Icc 0 1) (hd : delta ∈ Set.Icc 0 1)
(hmap : receiverChannel U = twoKrausChannel gamma delta) :
∃ t : ℝ, t ∈ Set.Icc 0 1 ∧
fullTracePrivateCapacity U = twoKrausValue gamma delta t ∧
∀ s ∈ Set.Icc (0 : ℝ) 1, twoKrausValue gamma delta s ≤ twoKrausValue gamma delta t := by sorry
end QAlgorithms.Papers.Independent.Support50.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every finite nonempty type with decidable equality, every complex matrix satisfying , and all , assume that, for every complex matrix ,
Then there exists such that
and, for every , the same expression with in place of is at most its value at . Here is binary entropy. The quantity is the supremum over nonnegative real rates with the following property: for every and slack , there is an integer such that every integer admits an integer , density matrices on the -fold input, and positive semidefinite measurement matrices on the -fold receiver output with , for which and . In this definition,
where , a density matrix is positive semidefinite with trace , and . The error uses this full trace norm, without a factor . All parameter endpoints are included, and the maximizing is not asserted to be unique.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.