Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.23 — unital qubit channels are mixed unitary

Open
WatrousTQI.unital_qubit_is_mixed_unitary

by Mrnaiq · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexitymixed-unitaryquantum-channelsquantum-information

Every trace-preserving completely positive map Φ\PhiΦ on a two-dimensional complex quantum system that preserves the identity admits a finite random-unitary representation. There are a finite number kkk, real probabilities p0,…,pk−1p_0,\ldots,p_{k-1}p0​,…,pk−1​ in [0,1][0,1][0,1] summing to one, and unitary matrices U0,…,Uk−1U_0,\ldots,U_{k-1}U0​,…,Uk−1​ such that

Φ(X)=∑j=0k−1pjUjXUj†\Phi(X)=\sum_{j=0}^{k-1}p_jU_jXU_j^\daggerΦ(X)=j=0∑k−1​pj​Uj​XUj†​

for every complex 2×22\times22×2 matrix XXX. The same probabilities and unitaries work for every operator. The statement fixes no number of terms and includes boundary cases with zero probabilities. It reuses the published random-unitary predicate instead of introducing a competing definition.

Preamble
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P11
set_option autoImplicit false
noncomputable section
open scoped Matrix ComplexConjugate BigOperators
Formal statement
namespace WatrousTQI

theorem unital_qubit_is_mixed_unitary
    (Φ : QAlgorithms.Superop (Fin 2) (Fin 2))
    (hΦ : QAlgorithms.IsChannel Φ)
    (hu : Φ (1 : Matrix (Fin 2) (Fin 2) ℂ) = 1) :
    QAlgorithms.Papers.Independent.Dependency50.P11.IsRandomUnitary Φ := by sorry

end WatrousTQI
Source
John Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, Chapter 4. https://cs.uwaterloo.ca/~watrous/TQI/TQI.pdf; Theorem 4.23, printed p.226 (PDF p.234), with Definition 4.2, printed p.202 (PDF p.210).
Read-back

What the Lean code literally says, in plain math · GPT-6 (Codex)

For every function Φ:M2(C)→M2(C)\Phi:M_2(\mathbb C)\to M_2(\mathbb C)Φ:M2​(C)→M2​(C), where matrices have rows and columns indexed by {0,1}\{0,1\}{0,1}, assume that there exist a natural number mmm and matrices Ej∈M2(C)E_j\in M_2(\mathbb C)Ej​∈M2​(C) indexed by j∈{0,…,m−1}j\in\{0,\ldots,m-1\}j∈{0,…,m−1} such that ∑j=0m−1Ej∗Ej=I2\sum_{j=0}^{m-1}E_j^*E_j=I_2∑j=0m−1​Ej∗​Ej​=I2​ and, for every ρ∈M2(C)\rho\in M_2(\mathbb C)ρ∈M2​(C), Φ(ρ)=∑j=0m−1EjρEj∗\Phi(\rho)=\sum_{j=0}^{m-1}E_j\rho E_j^*Φ(ρ)=∑j=0m−1​Ej​ρEj∗​; assume also that Φ(I2)=I2\Phi(I_2)=I_2Φ(I2​)=I2​. Then there exist, in order, a natural number kkk, a function p:{0,…,k−1}→Rp:\{0,\ldots,k-1\}\to\mathbb Rp:{0,…,k−1}→R, and a function V:{0,…,k−1}→U(2)V:\{0,\ldots,k-1\}\to U(2)V:{0,…,k−1}→U(2), where U(2)U(2)U(2) consists of complex 2×22\times22×2 matrices satisfying Vj∗Vj=VjVj∗=I2V_j^*V_j=V_jV_j^*=I_2Vj∗​Vj​=Vj​Vj∗​=I2​, such that for every index jjj, 0≤pj0\le p_j0≤pj​ and pj≤1p_j\le1pj​≤1, such that ∑j=0k−1pj=1\sum_{j=0}^{k-1}p_j=1∑j=0k−1​pj​=1, and such that for every X∈M2(C)X\in M_2(\mathbb C)X∈M2​(C), Φ(X)=∑j=0k−1(pj:C) VjXVj∗\Phi(X)=\sum_{j=0}^{k-1}(p_j:\mathbb C)\,V_jXV_j^*Φ(X)=∑j=0k−1​(pj​:C)Vj​XVj∗​. Here ∗*∗ denotes conjugate transpose, each sum is over the indicated finite index set, and the formula holds for all complex matrices, without any restriction to states. Both m=0m=0m=0 and k=0k=0k=0 are included in their natural-number quantifiers, with empty sums equal to zero, but m=0m=0m=0 cannot satisfy the Kraus identity 0=I20=I_20=I2​ and k=0k=0k=0 cannot satisfy the probability normalization 0=10=10=1.

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

    Confirmed by the moderator at approval.

  • Endorsed by Mrnaiq · Nov 12, 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