Theorem 15: polynomial Pauli channels and a modified-complement degrader
OpenQAlgorithms.Papers.Independent.Intakethird100.P50.polynomialPauli_modifiedComplementLet be real polynomials with . Put , and assume these four weights form a probability distribution for every in a right neighborhood of zero. Let be the coefficient of in , set , and let be the associated qubit Pauli channel with canonical Kraus-label complement. For every fixed choice of real satisfying whenever , define for and . The are physical eventually, and
Independently, there are and such that
The constants may depend on the fixed polynomial family (and on the fixed for the first bound), but not on . When , is unrestricted, and the scalar bound includes . This retains both numbered conclusions (23) and (24).
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P50
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be real polynomials satisfying , and suppose there exists such that the four numbers
are nonnegative and sum to for every . Let be the coefficient of degree in , and put . For any real four-vector , define , using the identity and usual Pauli matrices, and set and . For every satisfying
there exist and such that every gives nonnegative, sum-one modified weights
and satisfies . No condition is imposed on when . In addition, there exist and , separately quantified from those just described, such that every satisfies
Here ; a channel is a finite Kraus sum with Kraus completeness . For input space , , over arbitrary complex matrices on , and . The coefficient is the absolute value of the sum of the three products, and may be zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.