§VII (63): PPTp and zero-error capacities of Werner–Holevo channels
OpenQAlgorithms.Papers.Independent.Support50.P11.werner_ppt_capacitiesFor every integer , let be the Werner–Holevo channel. Its operational vanishing-error and zero-error quantum capacities under forward-assisted PPT-preserving codes satisfy
The zero-error capacity takes the supremum of exact finite-block rates over all positive block lengths and code dimensions. This states the channel corollary of the cited distillation result, with logarithms in bits.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Support50.P11
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing permutationMatrix)
open QAlgorithms.Papers.Independent.Information100.P21 (pt)
open QAlgorithms.Papers.Independent.Dependency50.P09 (tensorAction)
open QAlgorithms.Papers.Independent.Information100.P76 (swapMatrix)
open QAlgorithms.Papers.Independent.Information100.P69 (replacer)
open QAlgorithms.Papers.Independent.Gap20.P19 (wernerIsometry)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF p.11, (63): both PPTp capacities equal log2((d+2)/d).
At d=3 this is log2(5/3); the later 5/2 prose is not used. -/
theorem werner_ppt_capacities
(d : ℕ) (hd : 2 ≤ d) :
quantumCodeCapacity .PPTp (wernerHolevoChannel d 1) =
ENNReal.ofReal (Real.log (((d : ℝ) + 2) / d) / Real.log 2) ∧
zeroErrorCodeCapacity .PPTp (wernerHolevoChannel d 1) =
ENNReal.ofReal (Real.log (((d : ℝ) + 2) / d) / Real.log 2) := by sorry
end QAlgorithms.Papers.Independent.Support50.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer , put . Two quantities are asserted to equal the nonnegative extended real number
To define them, for positive integers , let be the real supremum of , where projects onto , over channels such that is also a channel and for all , for some channel . Here transposes the second factor, channels are finite Kraus maps with completeness , and
The tensor power applies to every factor of a product matrix unit. The first quantity is the supremum in of all such that as natural . The second is
with the supremum taken in , equivalently with a zero contribution from every pair not satisfying . The equality condition concerns the optimized supremum ; it does not itself state that a particular code attains that value. Rate zero and are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.