Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 17: sharper equal-error XZ degradability expansion

Open
QAlgorithms.Papers.Independent.Intakethird100.P50.xz_degradability_expansion

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let CpC_pCp​ be the qubit channel with independent X and Z errors, each of probability ppp:

Cp(ρ)=(1−p)2ρ+(p−p2)XρX+p2YρY+(p−p2)ZρZ.C_p(\rho)=(1-p)^2\rho+(p-p^2)X\rho X+p^2Y\rho Y+(p-p^2)Z\rho Z.Cp​(ρ)=(1−p)2ρ+(p−p2)XρX+p2YρY+(p−p2)ZρZ.

Use the canonical four-label dilation. There exist K≥0K\ge0K≥0 and 0<δ≤10<\delta\le10<δ≤1 such that

dg⁡(Cp)≤16p2+32p5/2+Kp3(0<p<δ).\operatorname{dg}(C_p)\le16p^2+32p^{5/2}+Kp^3\qquad(0<p<\delta).dg(Cp​)≤16p2+32p5/2+Kp3(0<p<δ).

The degradability parameter minimizes full diamond error over CPTP degrading maps. The fractional-power term is part of the sharper asserted expansion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P50
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P50

variable {A B E F : Type}

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype E] [DecidableEq E] [Fintype F] [DecidableEq F]

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

open QAlgorithms.Papers.Independent.Information100.P80 (log2)

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

open QAlgorithms.Papers.Independent.Support50.P07 (fullTracePrivateCapacity)

open QAlgorithms.Papers.Independent.Frontier18.P17 (clock)

/-- Theorem 17, PDF p.17: retains the fractional-power 32 p^(5/2) term.
The canonical XZ dilation has independent equal X and Z error probabilities p. -/
theorem xz_degradability_expansion :
    ∃ K : ℝ, 0 ≤ K ∧ ∃ delta : ℝ, 0 < delta ∧ delta ≤ 1 ∧
      ∀ p ∈ Set.Ioo 0 delta,
        degradability (xzDilation p) ≤
          16 * p ^ 2 + 32 * p ^ (5 / 2 : ℝ) + K * p ^ 3 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P50

end
Source
Quantum and private capacities of low-noise channels, arXiv:1705.04335v3, PDF p. 17, Theorem 17: sharper equal-error XZ degradability expansion
Read-back

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

For real ppp, define w(p)=((1−p)2,p−p2,p2,p−p2)w(p)=((1-p)^2,p-p^2,p^2,p-p^2)w(p)=((1−p)2,p−p2,p2,p−p2) and Vp:C2→C2⊗C4V_p:\mathbb C^2\to\mathbb C^2\otimes\mathbb C^4Vp​:C2→C2⊗C4 by (Vp)b,j;a=wj(p)(σj)ba(V_p)_{b,j;a}=\sqrt{w_j(p)}(\sigma_j)_{ba}(Vp​)b,j;a​=wj​(p)​(σj​)ba​, where σ0,σ1,σ2,σ3\sigma_0,\sigma_1,\sigma_2,\sigma_3σ0​,σ1​,σ2​,σ3​ are the identity and usual Pauli X,Y,ZX,Y,ZX,Y,Z matrices. Set Np(X)=Tr⁡E(VpXVp†)N_p(X)=\operatorname{Tr}_E(V_pXV_p^\dagger)Np​(X)=TrE​(Vp​XVp†​), Npc(X)=Tr⁡B(VpXVp†)N_p^c(X)=\operatorname{Tr}_B(V_pXV_p^\dagger)Npc​(X)=TrB​(Vp​XVp†​), and

η(Vp)=inf⁡{η∈[0,2]:∃D:C2→C4 a channel, ∥Npc−D∘Np∥⋄≤η}.\eta(V_p)=\inf\{\eta\in[0,2]:\exists D:\mathbb C^2\to\mathbb C^4\text{ a channel},\ \|N_p^c-D\circ N_p\|_\diamond\le\eta\}.η(Vp​)=inf{η∈[0,2]:∃D:C2→C4 a channel, ∥Npc​−D∘Np​∥⋄​≤η}.

A channel is a finite Kraus sum D(X)=∑jKjXKj†D(X)=\sum_jK_jXK_j^\daggerD(X)=∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. For a map with input space HHH, its diamond quantity is sup⁡∥X∥1≤1∥(id⁡H⊗T)(X)∥1\sup_{\|X\|_1\le1}\|(\operatorname{id}_H\otimes T)(X)\|_1sup∥X∥1​≤1​∥(idH​⊗T)(X)∥1​, over arbitrary complex matrices on H×HH\times HH×H, where ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. There exist real K≥0K\ge0K≥0 and 0<δ≤10<\delta\le10<δ≤1 such that every 0<p<δ0<p<\delta0<p<δ satisfies

η(Vp)≤16p2+32p5/2+Kp3.\eta(V_p)\le16p^2+32p^{5/2}+Kp^3.η(Vp​)≤16p2+32p5/2+Kp3.

The exponent 5/25/25/2 is a real exponent, and neither endpoint p=0,δp=0,\deltap=0,δ is included.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me