Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§VII (60)–(61): symmetric qutrit dilation and zero unassisted capacity

Open
QAlgorithms.Papers.Independent.Support50.P11.qutrit_symmetric_dilation_zero_capacity

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

prove2quantum

Let W(X)=(Tr⁡(X)I−XT)/2\mathcal W(X)=(\operatorname{Tr}(X)I-X^T)/2W(X)=(Tr(X)I−XT)/2 on a qutrit. In the ordered basis 0,1,20,1,20,1,2, define V(j,k),i=ϵijk/2V_{(j,k),i}=\epsilon_{ijk}/\sqrt2V(j,k),i​=ϵijk​/2​, with ϵ012=1\epsilon_{012}=1ϵ012​=1 and the usual alternating Levi-Civita symbol. Then

V†V=I,Tr⁡E(VXV†)=W(X)=Tr⁡B(VXV†)V^\dagger V=I,\qquad\operatorname{Tr}_E(VXV^\dagger)=\mathcal W(X)=\operatorname{Tr}_B(VXV^\dagger)V†V=I,TrE​(VXV†)=W(X)=TrB​(VXV†)

for every operator XXX, identifying the environment and output bases. Moreover the channel is antidegradable, in the operational sense that its environment output can be mapped by a CPTP channel to its channel output, and

QUA(W)=0.Q^{\mathrm{UA}}(\mathcal W)=0.QUA(W)=0.

This is the paper's concrete symmetric qutrit example with zero unassisted quantum capacity.

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.10, (60)--(61): the concrete qutrit self-complementary isometry,
antidegradability and zero operational unassisted quantum quantumCodeCapacity. -/
theorem qutrit_symmetric_dilation_zero_capacity :
    wernerIsometryᴴ * wernerIsometry = 1 ∧
    (∀ X : Matrix (Fin 3) (Fin 3) ℂ,
      traceRight (wernerIsometry * X * wernerIsometryᴴ) = wernerHolevoChannel 3 1 X ∧
      traceLeft (wernerIsometry * X * wernerIsometryᴴ) = wernerHolevoChannel 3 1 X) ∧
    HasAntidegradingDilation (wernerHolevoChannel 3 1) ∧ quantumCodeCapacity .UA (wernerHolevoChannel 3 1) = 0 := 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 (60)–(61): symmetric qutrit dilation and zero unassisted capacity
Read-back

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

Define W:C3→C3⊗C3W:\mathbb C^3\to\mathbb C^3\otimes\mathbb C^3W:C3→C3⊗C3, with indices i,j,k∈{0,1,2}i,j,k\in\{0,1,2\}i,j,k∈{0,1,2}, by W(i,j),k=0W_{(i,j),k}=0W(i,j),k​=0 if i=ji=ji=j, i=ki=ki=k, or j=kj=kj=k; otherwise set it to 1/21/\sqrt21/2​ if j=(i+1) mod 3j=(i+1)\bmod3j=(i+1)mod3, and to −1/2-1/\sqrt2−1/2​ otherwise. Define T(H)=(Tr⁡(H)13−HT)/2T(H)=(\operatorname{Tr}(H)1_3-H^{\mathsf T})/2T(H)=(Tr(H)13​−HT)/2. The assertion is that W†W=13W^\dagger W=1_3W†W=13​, that for every complex 3×33\times33×3 matrix HHH,

Tr⁡second(WHW†)=T(H),Tr⁡first(WHW†)=T(H),\operatorname{Tr}_{\text{second}}(WHW^\dagger)=T(H), \qquad \operatorname{Tr}_{\text{first}}(WHW^\dagger)=T(H),Trsecond​(WHW†)=T(H),Trfirst​(WHW†)=T(H),

and that TTT has an antidegrading dilation: there exist a positive integer eee, a matrix V:C3→C3⊗CeV:\mathbb C^3\to\mathbb C^3\otimes\mathbb C^eV:C3→C3⊗Ce with V†V=1V^\dagger V=1V†V=1, and a channel D:Mat⁡e→Mat⁡3D:\operatorname{Mat}_e\to\operatorname{Mat}_3D:Mate​→Mat3​ such that T(H)=Tr⁡e(VHV†)=D(Tr⁡3(VHV†))T(H)=\operatorname{Tr}_e(VHV^\dagger)=D(\operatorname{Tr}_3(VHV^\dagger))T(H)=Tre​(VHV†)=D(Tr3​(VHV†)) for every HHH. In addition, the following supremum in [0,∞][0,\infty][0,∞] equals zero: range over all real r≥0r\ge0r≥0 for which the optimal unassisted fidelity for T⊗nT^{\otimes n}T⊗n and qn=⌊2nr⌋q_n=\lfloor2^{nr}\rfloorqn​=⌊2nr⌋ tends to 111 as n→∞n\to\inftyn→∞. For a positive qqq, that optimal fidelity is the real supremum over channels A:Mat⁡q→Mat⁡3nA:\operatorname{Mat}_q\to\operatorname{Mat}_{3^n}A:Matq​→Mat3n​, B:Mat⁡3n→Mat⁡qB:\operatorname{Mat}_{3^n}\to\operatorname{Mat}_qB:Mat3n​→Matq​ of

Re⁡Tr⁡ ⁣[Φq(id⁡q⊗(B∘T⊗n∘A))(Φq)],\operatorname{Re}\operatorname{Tr}\!\left[ \Phi_q(\operatorname{id}_q\otimes(B\circ T^{\otimes n}\circ A))(\Phi_q) \right],ReTr[Φq​(idq​⊗(B∘T⊗n∘A))(Φq​)],

where Φq\Phi_qΦq​ projects onto q−1/2∑a∣a,a⟩q^{-1/2}\sum_a|a,a\rangleq−1/2∑a​∣a,a⟩; the tensor power is the linear map whose action on products of matrix units is the corresponding product of TTT's outputs. Channels mean finite Kraus maps with ∑jAj†Aj=1\sum_jA_j^\dagger A_j=1∑j​Aj†​Aj​=1. The rate r=0r=0r=0, for which qn=1q_n=1qn​=1, is 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