Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5 and Remark 2: full-algebra Shor extension

Proved
QAlgorithms.Papers.Independent.Gap48.P46.shor_extension_channel

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

prove2quantum

All quantum systems are nonzero finite-dimensional complex Hilbert spaces. States are positive semidefinite trace-one matrices, and channels are CPTP maps on the full matrix algebra. All entropies and logarithms are in bits. An ensemble is a finite probability distribution of states, with zero weights permitted. For a channel Φ\PhiΦ, write χΦ(ρ)\chi_\Phi(\rho)χΦ​(ρ) for the maximum ensemble Holevo information at mean ρ\rhoρ, H^Φ(ρ)\widehat H_\Phi(\rho)HΦ​(ρ) for the minimum average output entropy at that mean, and C‾(Φ;A)\overline C(\Phi;\mathcal A)C(Φ;A) for the maximum of χΦ\chi_\PhiχΦ​ over a nonempty closed mean constraint A\mathcal AA.

Let Φ\PhiΦ be a channel, 0≤E≤I0\le E\le I0≤E≤I, q∈[0,1]q\in[0,1]q∈[0,1], and d≥1d\ge1d≥1 an integer. For an arbitrary operator XXX on H⊗CdH\otimes\mathbb C^dH⊗Cd, let XjjX_{jj}Xjj​ be its diagonal label blocks and ρ=∑jXjj\rho=\sum_jX_{jj}ρ=∑j​Xjj​. Define the full-algebra map

Φ^(E,q,d)(X)=(1−q)Φ(ρ) ⊕ qdiag⁡(Tr⁡((I−E)ρ),Tr⁡(EX11),…,Tr⁡(EXdd)).\widehat\Phi(E,q,d)(X)=(1-q)\Phi(\rho)\ \oplus\ q\operatorname{diag}\bigl(\operatorname{Tr}((I-E)\rho),\operatorname{Tr}(EX_{11}),\ldots,\operatorname{Tr}(EX_{dd})\bigr).Φ(E,q,d)(X)=(1−q)Φ(ρ) ⊕ qdiag(Tr((I−E)ρ),Tr(EX11​),…,Tr(EXdd​)).

This map is CPTP and is unchanged when all off-diagonal label blocks of XXX are deleted. It agrees with the classical-array formula on diagonal arrays, while supplying the full quantum channel required by Remark 2. The cases d=1d=1d=1 and q=0,1q=0,1q=0,1 are included.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P46

open scoped Matrix ComplexConjugate ENNReal ComplexOrder

open Filter

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P62 (tensorChannel)

open QAlgorithms.Papers.Independent.Information100.P54 (relativeEntropyBits)

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

open QAlgorithms.Papers.Independent.Information100.P08
  (Ensemble ensembleAverage outputHolevo mixedRoof)

variable {I O J K : Type} [Fintype I] [Fintype O] [Fintype J] [Fintype K]

variable [DecidableEq I] [DecidableEq O] [DecidableEq J] [DecidableEq K]

/-- PDF pp.10–11, §5 and Remark 2: the explicit full-algebra Shor map is CPTP,
and input label dephasing leaves its output unchanged. -/
theorem shor_extension_channel [Nonempty I] [Nonempty O]
    (Phi : Superop I O) (hPhi : IsChannel Phi) (E : Matrix I I ℂ) (hE : IsEffect E)
    (q : ℝ) (hq : q ∈ Set.Icc (0 : ℝ) 1) (d : ℕ) (hd : 1 ≤ d) :
    IsChannel (shor Phi E q d) ∧ ∀ X,
      shor Phi E q d X = shor Phi E q d (dephaseLabel d X) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P46

end
Source
On Shor's channel extension and constrained channels, arXiv:quant-ph/0306196v2, PDF p. 10, §5 and Remark 2: full-algebra Shor extension
Read-back

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

Let I,OI,OI,O be finite nonempty types with decidable equality, let Φ\PhiΦ be a channel from matrices on III to matrices on OOO, let EEE be a matrix on III such that EEE and 1−E1-E1−E are positive semidefinite, let q∈[0,1]q\in[0,1]q∈[0,1], and let d≥1d\ge1d≥1 be an integer. For any complex matrix XXX on I×Fin⁡(d)I\times\operatorname{Fin}(d)I×Fin(d), put Xkl(i,j)=X((i,k),(j,l))X_{kl}(i,j)=X((i,k),(j,l))Xkl​(i,j)=X((i,k),(j,l)). Define Λ(X)\Lambda(X)Λ(X) on the disjoint union O⊔{⊥,0,…,d−1}O\sqcup\{\bot,0,\ldots,d-1\}O⊔{⊥,0,…,d−1} to have OOO-block (1−q)Φ(∑kXkk)(1-q)\Phi(\sum_kX_{kk})(1−q)Φ(∑k​Xkk​), diagonal entry qtr⁡((1−E)∑kXkk)q\operatorname{tr}((1-E)\sum_kX_{kk})qtr((1−E)∑k​Xkk​) at ⊥\bot⊥, diagonal entry qtr⁡(EXkk)q\operatorname{tr}(EX_{kk})qtr(EXkk​) at label kkk, and all other entries outside the OOO-block equal to zero. Then Λ\LambdaΛ is a channel: it has a finite representation Λ(X)=∑jLjXLj†\Lambda(X)=\sum_jL_jXL_j^\daggerΛ(X)=∑j​Lj​XLj†​ for every XXX, with ∑jLj†Lj=1\sum_jL_j^\dagger L_j=1∑j​Lj†​Lj​=1. Moreover, for every matrix XXX, including matrices that are not density matrices, Λ(X)=Λ(ΔdX)\Lambda(X)=\Lambda(\Delta_dX)Λ(X)=Λ(Δd​X), where (ΔdX)((i,k),(j,l))=X((i,k),(j,l))(\Delta_dX)((i,k),(j,l))=X((i,k),(j,l))(Δd​X)((i,k),(j,l))=X((i,k),(j,l)) when k=lk=lk=l and is 000 otherwise. Both endpoints q=0,1q=0,1q=0,1 and the case d=1d=1d=1 are 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