Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered (22)–(25): EBT conjugates and common-vector Kraus maps

Proved
QAlgorithms.Papers.Independent.Gap48.P36.ebt_hadamard_construction

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. For normalized rank-one Kraus matrices Fj=∣xj⟩⟨wj∣F_j=|x_j\rangle\langle w_j|Fj​=∣xj​⟩⟨wj​∣, put Xjk=⟨xk∣xj⟩X_{jk}=\langle x_k|x_j\rangleXjk​=⟨xk​∣xj​⟩ and (Wρ)jk=⟨wj∣ρ∣wk⟩(W_\rho)_{jk}=\langle w_j|\rho|w_k\rangle(Wρ​)jk​=⟨wj​∣ρ∣wk​⟩. Then the canonical conjugate is

ΦC(ρ)=X∗Wρ.\Phi^C(\rho)=X\mathbin{*}W_\rho.ΦC(ρ)=X∗Wρ​.

Here ∗*∗ is entrywise multiplication. Every factor CC†=XCC^\dagger=XCC†=X gives Kraus operators Rm=∑jcjm∣ej⟩⟨wj∣R_m=\sum_jc_{jm}|e_j\rangle\langle w_j|Rm​=∑j​cjm​∣ej​⟩⟨wj​∣ for this map. Conversely every normalized common-vector family of this form has a rank-one-Kraus, hence entanglement-breaking, conjugate. The corrected Gram order follows from tracing (23); wjw_jwj​ need not be orthogonal.

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 (22)–(25), PDF pp.11–12: common-vector Kraus characterization.
Correction: the printed Gram <x_j|x_k> is replaced by <x_k|x_j>, forced
by tracing |x_j><x_k| in (23). The converse is included. -/
theorem ebt_hadamard_construction [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty K]
    (w : K → EuclideanSpace ℂ A) (x : K → EuclideanSpace ℂ B)
    (hF : IsKrausFamily (rankOneKraus w x)) :
    complementaryChannel (indexedKrausDilation (rankOneKraus w x)) =
      arbitraryVectorComplement (gram x) w ∧
    (∀ v : Matrix K C ℂ, v * vᴴ = gram x →
      krausApply (gramKraus v w) = arbitraryVectorComplement (gram x) w) ∧
    (∀ v : Matrix K C ℂ, IsKrausFamily (gramKraus v w) →
      HasRankOneKraus (complementaryChannel (indexedKrausDilation (gramKraus v w)))) := 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. 11, Unnumbered (22)–(25): EBT conjugates and common-vector Kraus maps
Read-back

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

Let A,B,C,KA,B,C,KA,B,C,K be finite nonempty types with decidable equality, and choose arbitrary vectors wk∈CA,xk∈CBw_k\in\mathbb C^A,x_k\in\mathbb C^Bwk​∈CA,xk​∈CB. Put Fk=xkwk†F_k=x_kw_k^\daggerFk​=xk​wk†​ and assume ∑kFk†Fk=IA\sum_kF_k^\dagger F_k=I_A∑k​Fk†​Fk​=IA​. Define gjk=⟨xk,xj⟩g_{jk}=\langle x_k,x_j\ranglegjk​=⟨xk​,xj​⟩, using the complex inner product conjugate-linear in its first argument, and define

H(X)jk=gjk∑a,bwj(a)‾Xabwk(b).\mathcal H(X)_{jk} =g_{jk}\sum_{a,b}\overline{w_j(a)}X_{ab}w_k(b).H(X)jk​=gjk​a,b∑​wj​(a)​Xab​wk​(b).

If V(b,k),a=(Fk)baV_{(b,k),a}=(F_k)_{ba}V(b,k),a​=(Fk​)ba​, then the map X↦(∑b(VXV†)(b,j),(b,k))j,kX\mapsto\bigl(\sum_b(VXV^\dagger)_{(b,j),(b,k)}\bigr)_{j,k}X↦(∑b​(VXV†)(b,j),(b,k)​)j,k​ equals H\mathcal HH. Furthermore, every matrix v∈CK×Cv\in\mathbb C^{K\times C}v∈CK×C with vv†=gvv^\dagger=gvv†=g gives matrices (Gc)ka=vkcwk(a)‾(G_c)_{ka}=v_{kc}\overline{w_k(a)}(Gc​)ka​=vkc​wk​(a)​ satisfying ∑cGcXGc†=H(X)\sum_cG_cXG_c^\dagger=\mathcal H(X)∑c​Gc​XGc†​=H(X) for all XXX. Finally, for every v∈CK×Cv\in\mathbb C^{K\times C}v∈CK×C for which these GcG_cGc​ satisfy ∑cGc†Gc=IA\sum_cG_c^\dagger G_c=I_A∑c​Gc†​Gc​=IA​, the complementary map

X⟼(tr⁡(GcXGc′†))c,c′∈CX\longmapsto\bigl(\operatorname{tr}(G_cXG_{c'}^\dagger)\bigr)_{c,c'\in C}X⟼(tr(Gc​XGc′†​))c,c′∈C​

has a finite rank-one Kraus representation: there exist a natural number sss and vectors αi∈CA,βi∈CC\alpha_i\in\mathbb C^A,\beta_i\in\mathbb C^Cαi​∈CA,βi​∈CC such that this map equals X↦∑i=0s−1(βiαi†)X(βiαi†)†X\mapsto\sum_{i=0}^{s-1}(\beta_i\alpha_i^\dagger)X(\beta_i\alpha_i^\dagger)^\daggerX↦∑i=0s−1​(βi​αi†​)X(βi​αi†​)†. The last assertion does not require vv†=gvv^\dagger=gvv†=g, and the vectors in these representations are not separately assumed normalized.

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