Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 15: polynomial Pauli channels and a modified-complement degrader

Open
QAlgorithms.Papers.Independent.Intakethird100.P50.polynomialPauli_modifiedComplement

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

prove2quantum

Let p1,p2,p3p_1,p_2,p_3p1​,p2​,p3​ be real polynomials with pi(0)=0p_i(0)=0pi​(0)=0. Put p0(t)=1−∑i=13pi(t)p_0(t)=1-\sum_{i=1}^3p_i(t)p0​(t)=1−∑i=13​pi​(t), and assume these four weights form a probability distribution for every ttt in a right neighborhood of zero. Let cic_ici​ be the coefficient of ttt in pip_ipi​, set C=∣c1c2+c1c3+c2c3∣C=|c_1c_2+c_1c_3+c_2c_3|C=∣c1​c2​+c1​c3​+c2​c3​∣, and let NtN_tNt​ be the associated qubit Pauli channel with canonical Kraus-label complement. For every fixed choice of real a1,a2,a3a_1,a_2,a_3a1​,a2​,a3​ satisfying ai=4∑j≠icja_i=4\sum_{j\ne i}c_jai​=4∑j=i​cj​ whenever ci≠0c_i\ne0ci​=0, define qi(t)=pi(t+ait2)q_i(t)=p_i(t+a_it^2)qi​(t)=pi​(t+ai​t2) for i=1,2,3i=1,2,3i=1,2,3 and q0(t)=1−∑iqi(t)q_0(t)=1-\sum_iq_i(t)q0​(t)=1−∑i​qi​(t). The qi(t)q_i(t)qi​(t) are physical eventually, and

∥Ntc−Nq(t)c∘Nt∥⋄=O(t2).\|N_t^c-N_{q(t)}^c\circ N_t\|_\diamond=O(t^2).∥Ntc​−Nq(t)c​∘Nt​∥⋄​=O(t2).

Independently, there are K≥0K\ge0K≥0 and 0<δ≤10<\delta\le10<δ≤1 such that

dg⁡(Nt)≤256Ct2+Kt3(0<t<δ).\operatorname{dg}(N_t)\le256C t^2+Kt^3\qquad(0<t<\delta).dg(Nt​)≤256Ct2+Kt3(0<t<δ).

The constants may depend on the fixed polynomial family (and on the fixed aia_iai​ for the first bound), but not on ttt. When ci=0c_i=0ci​=0, aia_iai​ is unrestricted, and the scalar bound includes C=0C=0C=0. This retains both numbered conclusions (23) and (24).

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 15, PDF pp.16,20–21: polynomial evaluation in (22), arbitrary a_i
when c_i=0, and the sharp scalar bound (24) even when its coefficient is zero.
Source proof audit: the intermediate O(p^(5/2)) assertion at c_i=0 is not used
as a hypothesis or stated as a result; see MODERATION_NOTES.md. -/
theorem polynomialPauli_modifiedComplement (P : Fin 3 → Polynomial ℝ)
    (hP : PolynomialNoise P) :
    (∀ a : Fin 3 → ℝ,
      (∀ i, linearCoefficient P i ≠ 0 →
        a i = 4 * ∑ j ∈ Finset.univ.erase i, linearCoefficient P j) →
      ∃ K : ℝ, 0 ≤ K ∧ ∃ delta : ℝ, 0 < delta ∧ delta ≤ 1 ∧
        ∀ p ∈ Set.Ioo 0 delta,
          Probabilities (modifiedWeights P a p) ∧
          diamond (channelDifference (complementaryChannel (pauliDilation (polynomialWeights P p)))
            (complementaryChannel (pauliDilation (modifiedWeights P a p)) ∘
              receiverChannel (pauliDilation (polynomialWeights P p)))) ≤ K * p ^ 2) ∧
    (∃ K : ℝ, 0 ≤ K ∧ ∃ delta : ℝ, 0 < delta ∧ delta ≤ 1 ∧
      ∀ p ∈ Set.Ioo 0 delta,
        degradability (pauliDilation (polynomialWeights P p)) ≤
          256 * pairCoefficient P * p ^ 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. 16, Theorem 15: polynomial Pauli channels and a modified-complement degrader
Read-back

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

Let P0,P1,P2P_0,P_1,P_2P0​,P1​,P2​ be real polynomials satisfying Pi(0)=0P_i(0)=0Pi​(0)=0, and suppose there exists δP>0\delta_P>0δP​>0 such that the four numbers

w(p)=(1−P0(p)−P1(p)−P2(p),P0(p),P1(p),P2(p))w(p)=\bigl(1-P_0(p)-P_1(p)-P_2(p),P_0(p),P_1(p),P_2(p)\bigr)w(p)=(1−P0​(p)−P1​(p)−P2​(p),P0​(p),P1​(p),P2​(p))

are nonnegative and sum to 111 for every p∈[0,δP]p\in[0,\delta_P]p∈[0,δP​]. Let ℓi\ell_iℓi​ be the coefficient of degree 111 in PiP_iPi​, and put b=∣ℓ0ℓ1+ℓ0ℓ2+ℓ1ℓ2∣b=|\ell_0\ell_1+\ell_0\ell_2+\ell_1\ell_2|b=∣ℓ0​ℓ1​+ℓ0​ℓ2​+ℓ1​ℓ2​∣. For any real four-vector www, define V(w)b,j;a=wj(σj)baV(w)_{b,j;a}=\sqrt{w_j}(\sigma_j)_{ba}V(w)b,j;a​=wj​​(σj​)ba​, using the identity and usual Pauli X,Y,ZX,Y,ZX,Y,Z matrices, and set Nw(X)=Tr⁡E(V(w)XV(w)†)N_w(X)=\operatorname{Tr}_{E}(V(w)XV(w)^\dagger)Nw​(X)=TrE​(V(w)XV(w)†) and Nwc(X)=Tr⁡B(V(w)XV(w)†)N_w^c(X)=\operatorname{Tr}_{B}(V(w)XV(w)^\dagger)Nwc​(X)=TrB​(V(w)XV(w)†). For every a=(a0,a1,a2)∈R3a=(a_0,a_1,a_2)\in\mathbb R^3a=(a0​,a1​,a2​)∈R3 satisfying

ℓi≠0 ⟹ ai=4∑j≠iℓj,\ell_i\ne0\ \Longrightarrow\ a_i=4\sum_{j\ne i}\ell_j,ℓi​=0 ⟹ ai​=4j=i∑​ℓj​,

there exist K≥0K\ge0K≥0 and 0<δ≤10<\delta\le10<δ≤1 such that every 0<p<δ0<p<\delta0<p<δ gives nonnegative, sum-one modified weights

w~(p)=(1−∑iPi(p+aip2), P0(p+a0p2),P1(p+a1p2),P2(p+a2p2))\widetilde w(p)=\bigl(1-\textstyle\sum_iP_i(p+a_ip^2),\ P_0(p+a_0p^2),P_1(p+a_1p^2),P_2(p+a_2p^2)\bigr)w(p)=(1−∑i​Pi​(p+ai​p2), P0​(p+a0​p2),P1​(p+a1​p2),P2​(p+a2​p2))

and satisfies ∥Nw(p)c−Nw~(p)c∘Nw(p)∥⋄≤Kp2\|N_{w(p)}^c-N_{\widetilde w(p)}^c\circ N_{w(p)}\|_\diamond\le Kp^2∥Nw(p)c​−Nw(p)c​∘Nw(p)​∥⋄​≤Kp2. No condition is imposed on aia_iai​ when ℓi=0\ell_i=0ℓi​=0. In addition, there exist K≥0K\ge0K≥0 and 0<δ≤10<\delta\le10<δ≤1, separately quantified from those just described, such that every 0<p<δ0<p<\delta0<p<δ satisfies

η(V(w(p)))≤256 b p2+Kp3.\eta(V(w(p)))\le256\,b\,p^2+Kp^3.η(V(w(p)))≤256bp2+Kp3.

Here η(V)=inf⁡{η∈[0,2]:∃D a channel, ∥NVc−D∘NV∥⋄≤η}\eta(V)=\inf\{\eta\in[0,2]:\exists D\text{ a channel},\ \|N_V^c-D\circ N_V\|_\diamond\le\eta\}η(V)=inf{η∈[0,2]:∃D a channel, ∥NVc​−D∘NV​∥⋄​≤η}; a channel is a finite Kraus sum with Kraus completeness ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. For input space HHH, ∥T∥⋄=sup⁡∥X∥1≤1∥(id⁡H⊗T)(X)∥1\|T\|_\diamond=\sup_{\|X\|_1\le1}\|(\operatorname{id}_{H}\otimes T)(X)\|_1∥T∥⋄​=sup∥X∥1​≤1​∥(idH​⊗T)(X)∥1​, over arbitrary complex matrices on H×HH\times HH×H, and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. The coefficient bbb is the absolute value of the sum of the three products, and may be zero.

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