Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered appendix formula (93): exact unital-qubit output p-norm

Open
QAlgorithms.Papers.Independent.Gap48.P36.qubit_output_norm

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

prove2quantum

All Hilbert spaces have positive finite dimension. Channels are completely positive and trace preserving; conjugates use the same normalized pure-environment dilation. Write νp(Φ)=sup⁡ρ∥Φ(ρ)∥p\nu_p(\Phi)=\sup_\rho\|\Phi(\rho)\|_pνp​(Φ)=supρ​∥Φ(ρ)∥p​ and Smin⁡(Φ)=inf⁡ρS(Φ(ρ))S_{\min}(\Phi)=\inf_\rho S(\Phi(\rho))Smin​(Φ)=infρ​S(Φ(ρ)), with density inputs, Schatten norm, and von Neumann entropy. For a qubit Pauli probability channel with four nonnegative weights aka_kak​ summing to one, label the identity by 000 and the three axes by the nonzero binary Pauli labels. Put λk=2(a0+ak)−1\lambda_k=2(a_0+a_k)-1λk​=2(a0​+ak​)−1 and choose k∗k_*k∗​ maximizing ∣λk∣|\lambda_k|∣λk​∣. For real p≥1p\ge1p≥1,

νp(Φ)=[(1+λk∗2)p+(1−λk∗2)p]1/p=[(a0+ak∗)p+(∑j≠0,k∗aj)p]1/p.\nu_p(\Phi)=\left[\left(\frac{1+\lambda_{k_*}}2\right)^p+\left(\frac{1-\lambda_{k_*}}2\right)^p\right]^{1/p}=\left[(a_0+a_{k_*})^p+\left(\sum_{j\ne0,k_*}a_j\right)^p\right]^{1/p}.νp​(Φ)=[(21+λk∗​​​)p+(21−λk∗​​​)p]1/p=​(a0​+ak∗​​)p+​j=0,k∗​∑​aj​​p​1/p.

Both projectors (I±σk∗)/2(I\pm\sigma_{k_*})/2(I±σk∗​​)/2 are rank-one normalized optimizers with two nonzero Pauli coefficients, and they attain the sorted block bound. Here σk\sigma_kσk​ is the Hermitian representative, using iXZ=YiXZ=YiXZ=Y on the mixed label. Degenerate weights and p=1p=1p=1 are included.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P36
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P36

open scoped BigOperators Matrix Kronecker ComplexConjugate ComplexOrder ENNReal

open QAlgorithms.Papers.Independent.Claimed50.P48

open QAlgorithms.Papers.Independent.Information100.P67 (receiverChannel complementaryChannel)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy normalizedChoi)

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

open QAlgorithms.Papers.Independent.Information100.P03 (convexRoof)

open QAlgorithms.Papers.Independent.Dependency50.P45 (holevoCapacity)

attribute [local instance] Classical.propDecidable Classical.decEq

variable {A B C D E K L A2 B2 C2 : Type*}

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

variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]

variable [Fintype E] [DecidableEq E] [Fintype K] [DecidableEq K]

variable [Fintype L] [DecidableEq L] [Fintype A2] [DecidableEq A2]

variable [Fintype B2] [DecidableEq B2] [Fintype C2] [DecidableEq C2]

/-- Unnumbered exact qubit formula (93), PDF p.31: largest absolute Bloch multiplier.
The two eigenvalues are (1 plus/minus lambda)/2, including lambda=0 and 1. -/
theorem qubit_output_norm (a : WeylLabel 2 → ℝ) (ha : ProbabilityWeights a)
    (k : WeylLabel 2) (hk : k ≠ 0)
    (hmax : ∀ j : WeylLabel 2, j ≠ 0 → |qubitLambda a j| ≤ |qubitLambda a k|)
    (p : ℝ) (hp : 1 ≤ p) :
    nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a) =
      Real.rpow (Real.rpow ((1 + qubitLambda a k) / 2) p +
        Real.rpow ((1 - qubitLambda a k) / 2) p) (1 / p) ∧
    nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a) =
      Real.rpow (Real.rpow (a 0 + a k) p +
        Real.rpow (∑ j ∈ (Finset.univ.erase 0).erase k, a j) p) (1 / p) ∧
    (∀ positive : Bool, IsDensityMatrix (qubitAxisState k positive) ∧
      Matrix.rank (qubitAxisState k positive) = 1 ∧
      FlatSupport (finWeyl 2) (qubitAxisState k positive) 2 ∧
      schattenNorm (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a (qubitAxisState k positive)) =
        nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a)) ∧
    (∀ e : (Fin 2 × Fin 2) ≃ WeylLabel 2, SortedRows a e →
      nu (ENNReal.ofReal p) (randomUnitary (finWeyl 2) a) = blockBound p a e) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P36

end
Source
Properties of Conjugate Channels with Applications to Additivity and Multiplicativity, arXiv:quant-ph/0509126v3, PDF p. 31, Unnumbered appendix formula (93): exact unital-qubit output p-norm
Read-back

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

Let a:(Z/2Z)2→Ra:(\mathbb Z/2\mathbb Z)^2\to\mathbb Ra:(Z/2Z)2→R satisfy aj≥0a_j\ge0aj​≥0 and ∑jaj=1\sum_j a_j=1∑j​aj​=1, let k≠(0,0)k\ne(0,0)k=(0,0), and suppose that ∣λj∣≤∣λk∣|\lambda_j|\le|\lambda_k|∣λj​∣≤∣λk​∣ for every nonzero jjj, where λj=2(a0+aj)−1\lambda_j=2(a_0+a_j)-1λj​=2(a0​+aj​)−1. For every real p≥1p\ge1p≥1, put W(u,v)=XurepZvrepW_{(u,v)}=X^{u_{\mathrm{rep}}}Z^{v_{\mathrm{rep}}}W(u,v)​=Xurep​Zvrep​, with X=(0110)X=\begin{pmatrix}0&1\\1&0\end{pmatrix}X=(01​10​), Z=diag⁡(1,−1)Z=\operatorname{diag}(1,-1)Z=diag(1,−1), and define Φ(ρ)=∑jajWjρWj†\Phi(\rho)=\sum_j a_jW_j\rho W_j^\daggerΦ(ρ)=∑j​aj​Wj​ρWj†​. Write ∥Y∥p=(Re⁡tr⁡((Y†Y)p/2))1/p\|Y\|_p=(\operatorname{Re}\operatorname{tr}((Y^\dagger Y)^{p/2}))^{1/p}∥Y∥p​=(Retr((Y†Y)p/2))1/p, using continuous functional calculus, and νp(Φ)=sup⁡ρ≥0, tr⁡ρ=1∥Φ(ρ)∥p\nu_p(\Phi)=\sup_{\rho\ge0,\ \operatorname{tr}\rho=1}\|\Phi(\rho)\|_pνp​(Φ)=supρ≥0, trρ=1​∥Φ(ρ)∥p​. Then

νp(Φ)=[(1+λk2)p+(1−λk2)p]1/p=[(a0+ak)p+(∑j∉{0,k}aj)p]1/p.\nu_p(\Phi)=\left[\left(\frac{1+\lambda_k}{2}\right)^p+\left(\frac{1-\lambda_k}{2}\right)^p\right]^{1/p} =\left[(a_0+a_k)^p+\left(\sum_{j\notin\{0,k\}}a_j\right)^p\right]^{1/p}.νp​(Φ)=[(21+λk​​)p+(21−λk​​)p]1/p=​(a0​+ak​)p+​j∈/{0,k}∑​aj​​p​1/p.

Set Qk=iWkQ_k=iW_kQk​=iWk​ when k=(1,1)k=(1,1)k=(1,1), and Qk=WkQ_k=W_kQk​=Wk​ otherwise. For each Boolean choice bbb, the matrix ρb=12(I+sbQk)\rho_b=\tfrac12(I+s_bQ_k)ρb​=21​(I+sb​Qk​), where sb=1s_b=1sb​=1 for true and −1-1−1 for false, is positive semidefinite with trace 111, has rank 111, and satisfies ∥Φ(ρb)∥p=νp(Φ)\|\Phi(\rho_b)\|_p=\nu_p(\Phi)∥Φ(ρb​)∥p​=νp​(Φ); furthermore, exactly two labels jjj have tr⁡(Wj†ρb)≠0\operatorname{tr}(W_j^\dagger\rho_b)\ne0tr(Wj†​ρb​)=0, and every such coefficient has complex modulus 111. For every bijection e:{0,1}2→(Z/2Z)2e:\{0,1\}^2\to(\mathbb Z/2\mathbb Z)^2e:{0,1}2→(Z/2Z)2 satisfying 2i+j≤2i′+j′⇒ae(i′,j′)≤ae(i,j)2i+j\le2i'+j'\Rightarrow a_{e(i',j')}\le a_{e(i,j)}2i+j≤2i′+j′⇒ae(i′,j′)​≤ae(i,j)​, one also has

νp(Φ)=(∑i<2(∑j<2ae(i,j))p)1/p.\nu_p(\Phi)=\left(\sum_{i<2}\left(\sum_{j<2}a_{e(i,j)}\right)^p\right)^{1/p}.νp​(Φ)=(i<2∑​(j<2∑​ae(i,j)​)p)1/p.

Ties in the maximizing absolute value are permitted, and p=1p=1p=1 is included.

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