§VII (64): NS and EA capacities of Werner–Holevo channels
OpenQAlgorithms.Papers.Independent.Support50.P11.werner_nonSignalling_entanglement_capacitiesFor every integer , let . The operational NS and entanglement-assisted quantum capacities of its memoryless channel are
These capacities use normalized entanglement fidelity, parallel tensor powers and vanishing error. The formula concerns the antisymmetric endpoint and includes .
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, (64): NS and EA capacities of the antisymmetric endpoint channel. -/
theorem werner_nonSignalling_entanglement_capacities
(d : ℕ) (hd : 2 ≤ d) :
quantumCodeCapacity .NS (wernerHolevoChannel d 1) =
ENNReal.ofReal ((Real.log (2 * (d : ℝ) / ((d : ℝ) - 1)) / Real.log 2) / 2) ∧
quantumCodeCapacity .EA (wernerHolevoChannel d 1) =
ENNReal.ofReal ((Real.log (2 * (d : ℝ) / ((d : ℝ) - 1)) / Real.log 2) / 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 , define . Both the non-signalling and the entanglement-assisted quantum code capacities defined here equal
For either class , its capacity is the supremum of for which as natural . For a positive , is the real supremum over allowed channels of
where projects onto , and tensor powers apply to every factor of a product matrix unit. All allowed have a channel with for every . The non-signalling class additionally requires a channel with . The entanglement-assisted class instead requires finite positive-dimensional registers , a positive semidefinite trace-one matrix on , and channels from to and from to , whose local action after adjoining is . Every channel means a finite Kraus map with . The capacity suprema include rate zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.