Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII (62): generalized Werner–Holevo covariance and block simulation

Open
QAlgorithms.Papers.Independent.Support50.P11.werner_covariance_block_simulation

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

prove2quantum

For an integer d≥2d\ge2d≥2 and 0≤α≤10\le\alpha\le10≤α≤1, define

W(d,α)(X)=1−αd+1(Tr⁡(X)I+XT)+αd−1(Tr⁡(X)I−XT).\mathcal W^{(d,\alpha)}(X)=\frac{1-\alpha}{d+1}\bigl(\operatorname{Tr}(X)I+X^T\bigr)+\frac\alpha{d-1}\bigl(\operatorname{Tr}(X)I-X^T\bigr).W(d,α)(X)=d+11−α​(Tr(X)I+XT)+d−1α​(Tr(X)I−XT).

This is CPTP and, for every unitary UUU and every operator XXX,

W(d,α)(UXU†)=U‾W(d,α)(X)UT.\mathcal W^{(d,\alpha)}(UXU^\dagger)=\overline U\mathcal W^{(d,\alpha)}(X)U^T.W(d,α)(UXU†)=UW(d,α)(X)UT.

For each n≥1n\ge1n≥1, the parallel block W⊗n\mathcal W^{\otimes n}W⊗n has an exact local simulation with forward classical communication using its normalized Choi state, equivalently nnn single-use Choi states. For every K≥1K\ge1K≥1,

FPPTp(W⊗n,K)=FΓ(νW⊗n,K).F^{\mathrm{PPTp}}(\mathcal W^{\otimes n},K)=F_\Gamma(\nu_{\mathcal W^{\otimes n}},K).FPPTp(W⊗n,K)=FΓ​(νW⊗n​,K).

The output conjugation corrects the printed order in (62) using the channel's defining formula; both endpoints of α\alphaα are included.

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 pp.10--11, (62): the output conjugation is by entrywise conjugate U.
Printed U^T X conjugate(U) is corrected using (58)--(59). All parallel blocks admit
exact Choi simulation and have exactly the PPT distillation performance. -/
theorem werner_covariance_block_simulation
    (d : ℕ) (hd : 2 ≤ d) (alpha : ℝ) (ha0 : 0 ≤ alpha) (ha1 : alpha ≤ 1) :
    IsChannel (wernerHolevoChannel d alpha) ∧
    (∀ U : Matrix.unitaryGroup (Fin d) ℂ, ∀ X,
      wernerHolevoChannel d alpha (conjSuperop (U : Matrix (Fin d) (Fin d) ℂ) X) =
        conjSuperop (fun i j => conj ((U : Matrix (Fin d) (Fin d) ℂ) i j))
          (wernerHolevoChannel d alpha X)) ∧
    (∀ n : ℕ, 0 < n →
      HasChoiSimulation (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) ∧
      ∀ K : ℕ, 0 < K →
        optimalCodeFidelity .PPTp (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha)) K =
          distillFidelity (choiState (piSuperop (fun _ : Fin n => wernerHolevoChannel d alpha))) K) := 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. 10, §VII (62): generalized Werner–Holevo covariance and block simulation
Read-back

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

For every integer d≥2d\ge2d≥2 and real α∈[0,1]\alpha\in[0,1]α∈[0,1], define the map on complex d×dd\times dd×d matrices

T(H)=1−αd+1(Tr⁡(H)1d+HT)+αd−1(Tr⁡(H)1d−HT).T(H)=\frac{1-\alpha}{d+1}\bigl(\operatorname{Tr}(H)1_d+H^{\mathsf T}\bigr) +\frac{\alpha}{d-1}\bigl(\operatorname{Tr}(H)1_d-H^{\mathsf T}\bigr).T(H)=d+11−α​(Tr(H)1d​+HT)+d−1α​(Tr(H)1d​−HT).

Then TTT is a channel and, for every unitary UUU on Cd\mathbb C^dCd and every matrix HHH,

T(UHU†)=U‾ T(H) U‾†.T(UHU^\dagger)=\overline U\,T(H)\,\overline U^\dagger.T(UHU†)=UT(H)U†.

Here channels mean finite Kraus maps with ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1. Furthermore, for every positive integer nnn, the tensor power Tn=T⊗nT_n=T^{\otimes n}Tn​=T⊗n, defined on product matrix units by applying TTT in every coordinate, can be simulated from ωn=d−nJTn\omega_n=d^{-n}J_{T_n}ωn​=d−nJTn​​, where (JTn)(i,o),(j,o′)=[Tn(Eij)]o,o′(J_{T_n})_{(i,o),(j,o')}=[T_n(E_{ij})]_{o,o'}(JTn​​)(i,o),(j,o′)​=[Tn​(Eij​)]o,o′​: there exist a positive integer mmm, a channel M:Mat⁡dn×dn→Mat⁡mM:\operatorname{Mat}_{d^n\times d^n}\to\operatorname{Mat}_mM:Matdn×dn​→Matm​ with diagonal output on every input, and a channel D:Mat⁡m×dn→Mat⁡dnD:\operatorname{Mat}_{m\times d^n}\to\operatorname{Mat}_{d^n}D:Matm×dn​→Matdn​ such that D(Q)=Tn(H)D(Q)=T_n(H)D(Q)=Tn​(H) for every HHH, where

Q(c,o),(c′,o′)=[M ⁣((Huvωn(a,o),(a′,o′))(u,a),(v,a′))]c,c′.Q_{(c,o),(c',o')} = \left[M\!\left( (H_{uv}\omega_n{}_{(a,o),(a',o')})_{(u,a),(v,a')} \right)\right]_{c,c'}.Q(c,o),(c′,o′)​=[M((Huv​ωn​(a,o),(a′,o′)​)(u,a),(v,a′)​)]c,c′​.

For every positive integer KKK, the optimal PPT code fidelity for TnT_nTn​ equals the real supremum of Re⁡Tr⁡[ΦKY(ωn)]\operatorname{Re}\operatorname{Tr}[\Phi_KY(\omega_n)]ReTr[ΦK​Y(ωn​)] over maps Y:Mat⁡dn×dn→Mat⁡K×KY:\operatorname{Mat}_{d^n\times d^n}\to\operatorname{Mat}_{K\times K}Y:Matdn×dn​→MatK×K​ for which both YYY and Γ∘Y∘Γ\Gamma\circ Y\circ\GammaΓ∘Y∘Γ are channels. Here Φ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⟩, and Γ\GammaΓ transposes the second bipartite factor. The optimal code fidelity is the real supremum of Re⁡Tr⁡[ΦK(id⁡K⊗LTn,Z)(ΦK)]\operatorname{Re}\operatorname{Tr}[\Phi_K(\operatorname{id}_K\otimes\mathcal L_{T_n,Z})(\Phi_K)]ReTr[ΦK​(idK​⊗LTn​,Z​)(ΦK​)] 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 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 every HHH, for some channel EEE; the linked map has entries

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

The block quantifier excludes n=0n=0n=0 and includes K=1K=1K=1.

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