Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII (63): PPTp and zero-error capacities of Werner–Holevo channels

Open
QAlgorithms.Papers.Independent.Support50.P11.werner_ppt_capacities

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

For every integer d≥2d\ge2d≥2, let W(d,1)(X)=(Tr⁡(X)I−XT)/(d−1)\mathcal W^{(d,1)}(X)=(\operatorname{Tr}(X)I-X^T)/(d-1)W(d,1)(X)=(Tr(X)I−XT)/(d−1) be the Werner–Holevo channel. Its operational vanishing-error and zero-error quantum capacities under forward-assisted PPT-preserving codes satisfy

QPPTp(W(d,1))=Q0PPTp(W(d,1))=log⁡2d+2d.Q^{\mathrm{PPTp}}(\mathcal W^{(d,1)})=Q_0^{\mathrm{PPTp}}(\mathcal W^{(d,1)})=\log_2\frac{d+2}{d}.QPPTp(W(d,1))=Q0PPTp​(W(d,1))=log2​dd+2​.

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.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P11
Formal statement
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
Source
On the power of PPT-preserving and non-signalling codes, arXiv:1406.7142v2, PDF p. 11, §VII (63): PPTp and zero-error capacities of Werner–Holevo channels
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every integer d≥2d\ge2d≥2, put T(H)=(Tr⁡(H)1d−HT)/(d−1)T(H)=(\operatorname{Tr}(H)1_d-H^{\mathsf T})/(d-1)T(H)=(Tr(H)1d​−HT)/(d−1). Two quantities are asserted to equal the nonnegative extended real number

max⁡ ⁣{0,ln⁡((d+2)/d)ln⁡2}.\max\!\left\{0,\frac{\ln((d+2)/d)}{\ln2}\right\}.max{0,ln2ln((d+2)/d)​}.

To define them, for positive integers n,Kn,Kn,K, let Fn(K)F_n(K)Fn​(K) be the real supremum of Re⁡Tr⁡[ΦK(id⁡K⊗LT⊗n,Z)(ΦK)]\operatorname{Re}\operatorname{Tr}[\Phi_K(\operatorname{id}_K\otimes\mathcal L_{T^{\otimes n},Z})(\Phi_K)]ReTr[ΦK​(idK​⊗LT⊗n,Z​)(ΦK​)], where ΦK\Phi_KΦK​ projects onto K−1/2∑a∣a,a⟩K^{-1/2}\sum_a|a,a\rangleK−1/2∑a​∣a,a⟩, over channels Z:Mat⁡K×dn→Mat⁡dn×KZ:\operatorname{Mat}_{K\times d^n}\to\operatorname{Mat}_{d^n\times K}Z:MatK×dn​→Matdn×K​ such that ΓZΓ\Gamma Z\GammaΓZΓ is also a channel and Tr⁡KZ(H)=E(Tr⁡dnH)\operatorname{Tr}_K Z(H)=E(\operatorname{Tr}_{d^n}H)TrK​Z(H)=E(Trdn​H) for all HHH, for some channel EEE. Here Γ\GammaΓ transposes the second factor, channels are finite Kraus maps with completeness ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1, and

[LS,Z(H)]bc=∑a,a′,i,j,o,o′Haa′[S(Eij)]oo′[Z(E(a,o),(a′,o′))](i,b),(j,c).[\mathcal L_{S,Z}(H)]_{bc} =\sum_{a,a',i,j,o,o'}H_{aa'}[S(E_{ij})]_{oo'} [Z(E_{(a,o),(a',o')})]_{(i,b),(j,c)}.[LS,Z​(H)]bc​=a,a′,i,j,o,o′∑​Haa′​[S(Eij​)]oo′​[Z(E(a,o),(a′,o′)​)](i,b),(j,c)​.

The tensor power applies TTT to every factor of a product matrix unit. The first quantity is the supremum in [0,∞][0,\infty][0,∞] of all r≥0r\ge0r≥0 such that Fn(⌊2nr⌋)→1F_n(\lfloor2^{nr}\rfloor)\to1Fn​(⌊2nr⌋)→1 as natural n→∞n\to\inftyn→∞. The second is

sup⁡n,K≥1Fn(K)=1max⁡ ⁣{0,ln⁡Knln⁡2},\sup_{\substack{n,K\ge1\\F_n(K)=1}} \max\!\left\{0,\frac{\ln K}{n\ln2}\right\},n,K≥1Fn​(K)=1​sup​max{0,nln2lnK​},

with the supremum taken in [0,∞][0,\infty][0,∞], equivalently with a zero contribution from every pair not satisfying Fn(K)=1F_n(K)=1Fn​(K)=1. The equality condition concerns the optimized supremum Fn(K)F_n(K)Fn​(K); it does not itself state that a particular code attains that value. Rate zero and K=1K=1K=1 are included.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me