Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

B.3: unital-qubit antidegrader feasibility (94)–(98)

Open
QAlgorithms.Papers.Independent.Gap20.P19.unitalAntidegraderFeasibility

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

prove2quantum

All Hilbert spaces are finite dimensional, complex, and nonzero. A channel is completely positive and trace preserving on every operator. Write r(Φ)r(\Phi)r(Φ) for its Choi rank, the minimum pure-environment dimension. Receiver and complementary channels are always obtained from the same isometry.

Let σ0=I\sigma_0=Iσ0​=I and σ1,σ2,σ3=X,Y,Z\sigma_1,\sigma_2,\sigma_3=X,Y,Zσ1​,σ2​,σ3​=X,Y,Z. For real amplitudes ak≥0a_k\ge0ak​≥0 with ∑k=03ak2=1\sum_{k=0}^3a_k^2=1∑k=03​ak2​=1, put Pa(ρ)=∑k=03ak2σkρσkP_a(\rho)=\sum_{k=0}^3 a_k^2\sigma_k\rho\sigma_kPa​(ρ)=∑k=03​ak2​σk​ρσk​ and λk=a02+ak2−ai2−aj2\lambda_k=a_0^2+a_k^2-a_i^2-a_j^2λk​=a02​+ak2​−ai2​−aj2​, where {i,j,k}={1,2,3}\{i,j,k\}=\{1,2,3\}{i,j,k}={1,2,3}.

For real triples x,yx,yx,y, let

Y(x,y)=(1x3x1x2x31y2y1x1y21y3x2y1y31).Y(x,y)=\begin{pmatrix}1&x_3&x_1&x_2\\x_3&1&y_2&y_1\\x_1&y_2&1&y_3\\x_2&y_1&y_3&1\end{pmatrix}.Y(x,y)=​1x3​x1​x2​​x3​1y2​y1​​x1​y2​1y3​​x2​y1​y3​1​​.

Then PaP_aPa​ is antidegradable iff there exist x,yx,yx,y with Y(x,y)⪰0Y(x,y)\succeq0Y(x,y)⪰0 and 2a0akxk+2aiajyk=λk2a_0a_kx_k+2a_ia_jy_k=\lambda_k2a0​ak​xk​+2ai​aj​yk​=λk​ for all distinct i,j,ki,j,ki,j,k. For any such pair, the map (94), reconstructed as Ψx,y(R)=12(Tr⁡R I+∑kbk(R)σk)\Psi_{x,y}(R)=\tfrac12(\operatorname{Tr}R\,I+\sum_k b_k(R)\sigma_k)Ψx,y​(R)=21​(TrRI+∑k​bk​(R)σk​), is CPTP and satisfies Ψx,y∘PaC=Pa\Psi_{x,y}\circ P_a^C=P_aΨx,y​∘PaC​=Pa​, where b1=x1(R01+R10)+iy1(R23−R32)b_1=x_1(R_{01}+R_{10})+iy_1(R_{23}-R_{32})b1​=x1​(R01​+R10​)+iy1​(R23​−R32​) and the other two are obtained by the cycles (1,2,3)↦(2,3,1)(1,2,3)\mapsto(2,3,1)(1,2,3)↦(2,3,1) and (3,1,2)(3,1,2)(3,1,2). Necessarily ∣xk∣,∣yk∣≤1|x_k|,|y_k|\le1∣xk​∣,∣yk​∣≤1.

This direct PSD criterion remains valid at singular Schur-complement boundaries.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P19
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap20.P19

open scoped BigOperators Matrix ComplexConjugate ComplexOrder Kronecker

open Filter Topology

open QAlgorithms.Papers.Independent.Information100.P67
  (IsIsometry receiverChannel complementaryChannel IsDegradable IsAntidegradable
   maximumCoherentInformation dilationPower)

open QAlgorithms.Papers.Independent.Claimed50.P48
  (MinimalDilation indexedKrausDilation arbitraryVectorComplement superopTensor tensorDilation)

open QAlgorithms.Papers.Independent.Claimed50.P24 (ChannelEB)

open QAlgorithms.Papers.Independent.Information100.P60 (wernerHolevo)

open QAlgorithms.Papers.Independent.Gap48.P36 (finWeyl WeylLabel)

open QAlgorithms.Papers.Independent.Information100.P69 (choi)

open QAlgorithms.Papers.Independent.Information100.P50 (matrixRange)

open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C E F R K A2 B2 E2 : Type}

variable [Fintype A] [DecidableEq A] [Nonempty A]

variable [Fintype B] [DecidableEq B] [Nonempty B]

variable [Fintype C] [DecidableEq C] [Nonempty C]

variable [Fintype E] [DecidableEq E] [Nonempty E]

variable [Fintype F] [DecidableEq F] [Nonempty F]

variable [Fintype R] [DecidableEq R] [Nonempty R]

variable [Fintype K] [DecidableEq K]

variable [Fintype A2] [DecidableEq A2] [Nonempty A2]

variable [Fintype B2] [DecidableEq B2] [Nonempty B2]

variable [Fintype E2] [DecidableEq E2] [Nonempty E2]

/-- Appendix B.3, PDF pp.31–33, (94)–(98): necessary and sufficient PSD
feasibility, and the resulting explicit CPTP antidegrader. No inverse at y_k=±1. -/
theorem unitalAntidegraderFeasibility (a : Fin 4 → ℝ)
    (ha : ∀ k, 0 ≤ a k) (hnorm : ∑ k, a k^2 = 1) :
    ((∃ envSize : ℕ, ∃ witness : Matrix (_ × Fin envSize) _ ℂ, receiverChannel witness = (qubitPauliMap a) ∧ IsAntidegradable witness) ↔ ∃ x y : Fin 3 → ℝ,
      (feasibilityMatrix x y).PosSemidef ∧
      ∀ k : Fin 3, 2*a 0*a k.succ*x k + 2*a (k+1).succ*a (k+2).succ*y k =
        pauliMultipliers a k) ∧
    (∀ x y : Fin 3 → ℝ, (feasibilityMatrix x y).PosSemidef →
      (∀ k : Fin 3, 2*a 0*a k.succ*x k + 2*a (k+1).succ*a (k+2).succ*y k =
        pauliMultipliers a k) →
      IsChannel (pauliAntidegrader x y) ∧
      (∀ rho, pauliAntidegrader x y
        (complementaryChannel (indexedKrausDilation (pauliKraus a)) rho) = qubitPauliMap a rho) ∧
      (∀ k, |x k| ≤ 1 ∧ |y k| ≤ 1)) := by sorry

end QAlgorithms.Papers.Independent.Gap20.P19

end
Source
The structure of degradable quantum channels, arXiv:0802.1360v2, PDF p. 30, B.3: unital-qubit antidegrader feasibility (94)–(98)
Read-back

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

Let a0,a1,a2,a3a_0,a_1,a_2,a_3a0​,a1​,a2​,a3​ be nonnegative real numbers satisfying ∑j=03aj2=1\sum_{j=0}^{3}a_j^2=1∑j=03​aj2​=1. Write σ0=I\sigma_0=Iσ0​=I and σ1,σ2,σ3\sigma_1,\sigma_2,\sigma_3σ1​,σ2​,σ3​ for the standard Pauli X,Y,ZX,Y,ZX,Y,Z matrices, put Φa(ρ)=∑j=03aj2σjρσj†\Phi_a(\rho)=\sum_{j=0}^{3}a_j^2\sigma_j\rho\sigma_j^\daggerΦa​(ρ)=∑j=03​aj2​σj​ρσj†​, and set λ=(a02+a12−a22−a32, a02−a12+a22−a32, a02−a12−a22+a32)\lambda=(a_0^2+a_1^2-a_2^2-a_3^2,\ a_0^2-a_1^2+a_2^2-a_3^2,\ a_0^2-a_1^2-a_2^2+a_3^2)λ=(a02​+a12​−a22​−a32​, a02​−a12​+a22​−a32​, a02​−a12​−a22​+a32​). There exists a natural number rrr and an isometry W:C2→C2×rW:\mathbb C^2\to\mathbb C^{2\times r}W:C2→C2×r whose receiver map is Φa\Phi_aΦa​ and for which some channel maps its complementary output back to its receiver output on every matrix if and only if there exist real triples x,yx,yx,y such that

F(x,y)=(1x2x0x1x21y1y0x0y11y2x1y0y21)≥0,2a0ak+1xk+2a(k+1 mod 3)+1a(k+2 mod 3)+1yk=λkF(x,y)= \begin{pmatrix} 1&x_2&x_0&x_1\\ x_2&1&y_1&y_0\\ x_0&y_1&1&y_2\\ x_1&y_0&y_2&1 \end{pmatrix}\ge0, \qquad 2a_0a_{k+1}x_k+2a_{(k+1\bmod3)+1}a_{(k+2\bmod3)+1}y_k=\lambda_kF(x,y)=​1x2​x0​x1​​x2​1y1​y0​​x0​y1​1y2​​x1​y0​y2​1​​≥0,2a0​ak+1​xk​+2a(k+1mod3)+1​a(k+2mod3)+1​yk​=λk​

for k=0,1,2k=0,1,2k=0,1,2. Moreover, every such pair x,yx,yx,y defines a channel

Dx,y(r)=12[Tr⁡(r)I+(x0(r01+r10)+iy0(r23−r32))σ1+(x1(r02+r20)+iy1(r31−r13))σ2+(x2(r03+r30)+iy2(r12−r21))σ3]D_{x,y}(r)=\frac12\left[ \operatorname{Tr}(r)I+ \bigl(x_0(r_{01}+r_{10})+iy_0(r_{23}-r_{32})\bigr)\sigma_1+ \bigl(x_1(r_{02}+r_{20})+iy_1(r_{31}-r_{13})\bigr)\sigma_2+ \bigl(x_2(r_{03}+r_{30})+iy_2(r_{12}-r_{21})\bigr)\sigma_3 \right]Dx,y​(r)=21​[Tr(r)I+(x0​(r01​+r10​)+iy0​(r23​−r32​))σ1​+(x1​(r02​+r20​)+iy1​(r31​−r13​))σ2​+(x2​(r03​+r30​)+iy2​(r12​−r21​))σ3​]

satisfying Dx,y(Ca(ρ))=Φa(ρ)D_{x,y}(C_a(\rho))=\Phi_a(\rho)Dx,y​(Ca​(ρ))=Φa​(ρ) for every matrix ρ\rhoρ, where (Ca(ρ))j,l=Tr⁡(ajσjρ(alσl)†)(C_a(\rho))_{j,l}=\operatorname{Tr}(a_j\sigma_j\rho(a_l\sigma_l)^\dagger)(Ca​(ρ))j,l​=Tr(aj​σj​ρ(al​σl​)†); it also satisfies ∣xk∣≤1|x_k|\le1∣xk​∣≤1 and ∣yk∣≤1|y_k|\le1∣yk​∣≤1 for each kkk. Throughout, a channel means a finite Kraus map with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I; the existential environment size includes r=0r=0r=0, which cannot support the required isometry.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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