Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The maximum coherent information of a retained switched channel

Open
QAlgorithms.Papers.Independent.Intakenext100.P70.switchedMaximum

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let S,A,BS,A,BS,A,B be finite nonempty registers with fixed orthonormal computational bases, and let Ni:A→B\mathcal N_i:A\to BNi​:A→B be a completely positive trace-preserving map for each basis index iii of SSS. Let Pi(X)=∣i⟩⟨i∣X∣i⟩⟨i∣\mathcal P_i(X)=|i\rangle\langle i|X|i\rangle\langle i|Pi​(X)=∣i⟩⟨i∣X∣i⟩⟨i∣ and define the measured, retained switch N=∑iPi⊗Ni\mathcal N=\sum_i\mathcal P_i\otimes\mathcal N_iN=∑i​Pi​⊗Ni​. Then

max⁡ρSAIcoh(N,ρSA)=max⁡imax⁡ρAIcoh(Ni,ρA).\max_{\rho^{SA}} I_{\mathrm{coh}}(\mathcal N,\rho^{SA}) =\max_i\max_{\rho^A} I_{\mathrm{coh}}(\mathcal N_i,\rho^A).ρSAmax​Icoh​(N,ρSA)=imax​ρAmax​Icoh​(Ni​,ρA).

All optimizations range over every density matrix on the stated register, and all maxima are attained. In particular there are iii and a density matrix ρA\rho^AρA for which ∣i⟩⟨i∣⊗ρA|i\rangle\langle i|\otimes\rho^A∣i⟩⟨i∣⊗ρA attains the left-hand maximum. Coherent information uses entropy in bits.

Thus correlations and coherent inputs in the switch cannot improve the optimum beyond a definite switch setting.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P70
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P70

noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P22
  (Op coherentInformation singleUseInformation quantumCapacity mixed)

/-- Supplementary Lemma 1, PDF p.5, S4. Optimization on the left includes all coherent
and correlated switch inputs. The extra attainment clauses express the printed maxima,
rather than assuming maximizing density matrices as hypotheses. -/
theorem switchedMaximum {S A B : Type*} [Fintype S] [Fintype A] [Fintype B]
    [DecidableEq S] [DecidableEq A] [DecidableEq B]
    [Nonempty S] [Nonempty A] [Nonempty B]
    (branches : S → Superop A B) (hbranches : ∀ i, IsChannel (branches i)) :
    singleUseInformation (cubittSwitched branches) =
      sSup (Set.range (fun i => singleUseInformation (branches i))) ∧
    (∀ i, ∃ rho : Op A, IsDensityMatrix rho ∧
      coherentInformation (branches i) rho = singleUseInformation (branches i)) ∧
    ∃ i : S, ∃ rho : Op A, IsDensityMatrix rho ∧
      IsDensityMatrix (cubittSelectedInput i rho) ∧
      coherentInformation (branches i) rho = singleUseInformation (cubittSwitched branches) ∧
      coherentInformation (cubittSwitched branches) (cubittSelectedInput i rho) =
        singleUseInformation (cubittSwitched branches) := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P70
Source
Unbounded number of channel uses are required to see quantum capacity, arXiv:1408.5115v1, PDF p. 5, Supplementary Lemma 1, Eq. (S4)
Read-back

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

Let S,A,BS,A,BS,A,B be finite nonempty types, each with decidable equality, and let (Φi)i∈S(\Phi_i)_{i\in S}(Φi​)i∈S​ be maps from complex matrices over AAA to complex matrices over BBB, each admitting a finite Kraus representation Φi(X)=∑jEi,jXEi,j†\Phi_i(X)=\sum_jE_{i,j}XE_{i,j}^\daggerΦi​(X)=∑j​Ei,j​XEi,j†​ with ∑jEi,j†Ei,j=IA\sum_jE_{i,j}^\dagger E_{i,j}=I_A∑j​Ei,j†​Ei,j​=IA​. Define the switched map Ψ\PsiΨ by

Ψ(X)(i,b),(j,c)={Φi(Xii)b,c,i=j,0,i≠j,Xa,a′ii=X(i,a),(i,a′),\Psi(X)_{(i,b),(j,c)} =\begin{cases} \Phi_i(X^{ii})_{b,c},&i=j,\\ 0,&i\ne j, \end{cases} \qquad X^{ii}_{a,a'}=X_{(i,a),(i,a')},Ψ(X)(i,b),(j,c)​={Φi​(Xii)b,c​,0,​i=j,i=j,​Xa,a′ii​=X(i,a),(i,a′)​,

and define the selected input ρ^ i\widehat\rho^{\,i}ρ​i by ρ^(j,a),(j′,a′) i=ρa,a′\widehat\rho^{\,i}_{(j,a),(j',a')}=\rho_{a,a'}ρ​(j,a),(j′,a′)i​=ρa,a′​ when j=j′=ij=j'=ij=j′=i, and 000 otherwise. For a map Θ\ThetaΘ and density matrix ρ\rhoρ, write

I(Θ,ρ)=S(Θ(ρ))−S((id⊗Θ)(∣vρ⟩⟨vρ∣)),J(Θ)=sup⁡ρ⪰0, tr⁡ρ=1I(Θ,ρ),I(\Theta,\rho)=S(\Theta(\rho)) -S((\mathrm{id}\otimes\Theta)(|v_\rho\rangle\langle v_\rho|)), \qquad J(\Theta)=\sup_{\rho\succeq0,\ \operatorname{tr}\rho=1}I(\Theta,\rho),I(Θ,ρ)=S(Θ(ρ))−S((id⊗Θ)(∣vρ​⟩⟨vρ​∣)),J(Θ)=ρ⪰0, trρ=1sup​I(Θ,ρ),

where vρ(a,a′)=(ρ)a′,av_\rho(a,a')=(\sqrt\rho)_{a',a}vρ​(a,a′)=(ρ​)a′,a​, the identity extension applies Θ\ThetaΘ separately to each matrix block with fixed reference indices, and S(Z)=−Re⁡tr⁡f(Z)S(Z)=-\operatorname{Re}\operatorname{tr}f(Z)S(Z)=−Retrf(Z) for f(u)=ulog⁡2uf(u)=u\log_2uf(u)=ulog2​u applied by continuous functional calculus. The theorem asserts all three of the following: J(Ψ)=sup⁡{J(Φi):i∈S}J(\Psi)=\sup\{J(\Phi_i):i\in S\}J(Ψ)=sup{J(Φi​):i∈S}; for every i∈Si\in Si∈S, there exists a positive semidefinite trace-one ρ\rhoρ on AAA with I(Φi,ρ)=J(Φi)I(\Phi_i,\rho)=J(\Phi_i)I(Φi​,ρ)=J(Φi​); and there exist i∈Si\in Si∈S and a positive semidefinite trace-one ρ\rhoρ on AAA, whose selected input ρ^ i\widehat\rho^{\,i}ρ​i is also positive semidefinite with trace one, such that

I(Φi,ρ)=J(Ψ)andI(Ψ,ρ^ i)=J(Ψ).I(\Phi_i,\rho)=J(\Psi) \quad\text{and}\quad I(\Psi,\widehat\rho^{\,i})=J(\Psi).I(Φi​,ρ)=J(Ψ)andI(Ψ,ρ​i)=J(Ψ).
Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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