Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Balanced convex decomposition of a standard-form unital qubit channel

Open
QAlgorithms.Papers.Independent.Support50.P13.phaseDampingBalancedDecomposition

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

prove2quantum

Let Φ:M2(C)→M2(C)\Phi:M_2(\mathbb C)\to M_2(\mathbb C)Φ:M2​(C)→M2​(C) be a unital completely positive trace-preserving linear map in standard form: for the ordered Pauli matrices σ1,σ2,σ3\sigma_1,\sigma_2,\sigma_3σ1​,σ2​,σ3​, suppose Φ(σj)=λjσj\Phi(\sigma_j)=\lambda_j\sigma_jΦ(σj​)=λj​σj​ with real parameters satisfying 1≥λ3≥max⁡(∣λ1∣,∣λ2∣)1\ge\lambda_3\ge\max(|\lambda_1|,|\lambda_2|)1≥λ3​≥max(∣λ1​∣,∣λ2​∣). Put λ=λ3\lambda=\lambda_3λ=λ3​, which equals max⁡j∣λj∣\max_j|\lambda_j|maxj​∣λj​∣ and is nonnegative. Let rrr be any qubit density matrix. Then there exist N≥1N\ge1N≥1, nonnegative real coefficients cic_ici​ with ∑i=1Nci=1\sum_{i=1}^Nc_i=1∑i=1N​ci​=1, and unitary qubit matrices Ui,WiU_i,W_iUi​,Wi​, such that

Tr⁡(σ3UirUi∗)=0(1≤i≤N),Φ(A)=∑i=1NciWiΨλ(UiAUi∗)Wi∗for every A∈M2(C).\begin{gathered} \operatorname{Tr}(\sigma_3U_irU_i^*)=0\quad(1\le i\le N),\\ \Phi(A)=\sum_{i=1}^N c_iW_i\Psi_\lambda(U_iAU_i^*)W_i^* \quad\text{for every }A\in M_2(\mathbb C). \end{gathered}Tr(σ3​Ui​rUi∗​)=0(1≤i≤N),Φ(A)=i=1∑N​ci​Wi​Ψλ​(Ui​AUi∗​)Wi∗​for every A∈M2​(C).​

The phase-damping map Ψλ\Psi_\lambdaΨλ​ preserves diagonal entries and multiplies off-diagonal entries by λ\lambdaλ. The family may depend on the given state rrr, but it decomposes the entire channel. This is the convex decomposition used to obtain balanced half-noisy bounds.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P13
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Support50.P13

open QAlgorithms.Papers.Independent.Gap48.P03
  (productChannel maximumOutputPNorm holevoQuantity depolarizingNormFactor
    phaseChannel qubitPauli)

open QAlgorithms.Papers.Independent.Next46.P42 (minimumOutputEntropy)

open QAlgorithms.Papers.Independent.Information100.P63 (schatten)

open QAlgorithms.Papers.Independent.Dependency50.P23 (ordinaryClassicalCapacity)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- King quant-ph/0103156v2, PDF pp.11-12, (54)-(56), Lemma 4 and (59).
Standard form means Pauli diagonality and lambda_3=max |lambda_i|<=1.
For each given state the chosen family decomposes Phi on ALL operators.
Coefficients here are nonnegative, as required for a convex combination. -/
theorem phaseDampingBalancedDecomposition
    (Phi : Superop (Fin 2) (Fin 2)) (hPhi : IsChannel Phi)
    (hPhiUnital : Phi 1 = 1) (lam : Fin 3 → ℝ)
    (hX : Phi (qubitPauli pauliX) = (lam 0 : ℂ) • qubitPauli pauliX)
    (hY : Phi (qubitPauli pauliY) = (lam 1 : ℂ) • qubitPauli pauliY)
    (hZ : Phi (qubitPauli pauliZ) = (lam 2 : ℂ) • qubitPauli pauliZ)
    (hhigh : lam 2 ≤ 1) (hmax : ∀ i, |lam i| ≤ lam 2)
    (r : Matrix (Fin 2) (Fin 2) ℂ) (hr : IsDensityMatrix r) :
    ∃ (N : ℕ) (c : Fin N → ℝ)
      (U W : Fin N → Matrix.unitaryGroup (Fin 2) ℂ),
      1 ≤ N ∧ (∀ i, 0 ≤ c i) ∧ (∑ i, c i) = 1 ∧
      (∀ i, ((qubitPauli pauliZ) *
        conjSuperop (U i : Matrix (Fin 2) (Fin 2) ℂ) r).trace = 0) ∧
      ∀ A : Matrix (Fin 2) (Fin 2) ℂ,
        Phi A = ∑ i, (c i : ℂ) •
          conjSuperop (W i : Matrix (Fin 2) (Fin 2) ℂ)
            (phaseChannel (1 : Matrix (Fin 2) (Fin 2) ℂ) (lam 2)
              (conjSuperop (U i : Matrix (Fin 2) (Fin 2) ℂ) A)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P13

end
Source
Additivity for a class of unital qubit channels, arXiv:quant-ph/0103156v2, PDF p. 12, Lemma 4, equation (59); standard form on PDF p.11
Read-back

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

Let Φ:Mat⁡2(C)→Mat⁡2(C)\Phi:\operatorname{Mat}_2(\mathbb C)\to\operatorname{Mat}_2(\mathbb C)Φ:Mat2​(C)→Mat2​(C) admit a finite Kraus representation Φ(A)=∑jLjALj†\Phi(A)=\sum_jL_jAL_j^\daggerΦ(A)=∑j​Lj​ALj†​ with ∑jLj†Lj=I2\sum_jL_j^\dagger L_j=I_2∑j​Lj†​Lj​=I2​, and suppose Φ(I2)=I2\Phi(I_2)=I_2Φ(I2​)=I2​. Let λ0,λ1,λ2\lambda_0,\lambda_1,\lambda_2λ0​,λ1​,λ2​ be real numbers such that

Φ(X)=λ0X,Φ(Y)=λ1Y,Φ(Z)=λ2Z,λ2≤1,∣λi∣≤λ2(i=0,1,2),\Phi(X)=\lambda_0X,\qquad \Phi(Y)=\lambda_1Y,\qquad \Phi(Z)=\lambda_2Z,\qquad \lambda_2\le1,\qquad |\lambda_i|\le\lambda_2\quad(i=0,1,2),Φ(X)=λ0​X,Φ(Y)=λ1​Y,Φ(Z)=λ2​Z,λ2​≤1,∣λi​∣≤λ2​(i=0,1,2),

where

X=(0110),Y=(0−ii0),Z=(100−1).X=\begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad Y=\begin{pmatrix}0&-\mathrm i\\ \mathrm i&0\end{pmatrix},\qquad Z=\begin{pmatrix}1&0\\0&-1\end{pmatrix}.X=(01​10​),Y=(0i​−i0​),Z=(10​0−1​).

For every positive semidefinite trace-one 2×22\times22×2 matrix rrr, there exist a natural N≥1N\ge1N≥1, nonnegative real coefficients c0,…,cN−1c_0,\ldots,c_{N-1}c0​,…,cN−1​ summing to 111, and unitary matrices Ui,WiU_i,W_iUi​,Wi​ such that tr⁡(ZUirUi†)=0\operatorname{tr}(ZU_irU_i^\dagger)=0tr(ZUi​rUi†​)=0 as a complex equality for every iii, and, for every complex 2×22\times22×2 matrix AAA,

Φ(A)=∑i=0N−1ciWi[λ2UiAUi†+(1−λ2)diag⁡ ⁣((UiAUi†)00,(UiAUi†)11)]Wi†.\Phi(A)=\sum_{i=0}^{N-1}c_iW_i \left[\lambda_2U_iAU_i^\dagger +(1-\lambda_2)\operatorname{diag}\!\left((U_iAU_i^\dagger)_{00},(U_iAU_i^\dagger)_{11}\right)\right]W_i^\dagger.Φ(A)=i=0∑N−1​ci​Wi​[λ2​Ui​AUi†​+(1−λ2​)diag((Ui​AUi†​)00​,(Ui​AUi†​)11​)]Wi†​.

The coefficient hypotheses include λ2=0\lambda_2=0λ2​=0 and λ2=1\lambda_2=1λ2​=1; coefficients ci=0c_i=0ci​=0 are allowed, and the balance condition is required even for such indices. The chosen decomposition may depend on rrr, but its displayed identity must hold for every matrix AAA, without a positivity or normalization restriction on AAA.

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

    Confirmed by the moderator at approval.

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