Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-dimensional teleportation covariance and the Choi commutator

Proved
QAlgorithms.Papers.Independent.Dependency50.P04.teleportationCovariant_iff_choiCommutes

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

prove2quantum

Let d,ed,ed,e be positive integers and let E\mathcal EE be a completely positive trace-preserving map from a ddd-dimensional input to an eee-dimensional output. Put X∣j⟩=∣j+1(modd)⟩X|j\rangle=|j+1\pmod d\rangleX∣j⟩=∣j+1(modd)⟩, Z∣j⟩=e2πij/d∣j⟩Z|j\rangle=e^{2\pi i j/d}|j\rangleZ∣j⟩=e2πij/d∣j⟩, and Uab=XaZbU_{ab}=X^aZ^bUab​=XaZb. Define the normalized Choi state, reference first, by ρE=d−1∑i,j∣i⟩⟨j∣⊗E(∣i⟩⟨j∣)\rho_{\mathcal E}=d^{-1}\sum_{i,j}|i\rangle\langle j|\otimes\mathcal E(|i\rangle\langle j|)ρE​=d−1∑i,j​∣i⟩⟨j∣⊗E(∣i⟩⟨j∣).

The channel is teleportation-covariant, meaning that for each a,ba,ba,b a single output unitary VabV_{ab}Vab​ satisfies E(UabρUab†)=VabE(ρ)Vab†\mathcal E(U_{ab}\rho U_{ab}^{\dagger})=V_{ab}\mathcal E(\rho)V_{ab}^{\dagger}E(Uab​ρUab†​)=Vab​E(ρ)Vab†​ for every density matrix ρ\rhoρ, if and only if

∀a,b∈{0,…,d−1},∃Vab∈U(e):[ρE,Uab‾⊗Vab]=0.\forall a,b\in\{0,\ldots,d-1\},\quad\exists V_{ab}\in\mathrm U(e):\quad [\rho_{\mathcal E},\overline{U_{ab}}\otimes V_{ab}]=0.∀a,b∈{0,…,d−1},∃Vab​∈U(e):[ρE​,Uab​​⊗Vab​]=0.

The bar denotes entrywise complex conjugation. The output correction need not be a teleportation unitary, and the dimensions may differ. This gives a characterization of teleportation covariance directly from the channel's Choi state.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P04
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Dependency50.P04

/-- PDF p.14, Eqs.(79)--(80): a finite-dimensional channel is
teleportation-covariant iff each input teleportation matrix U admits an output
unitary V commuting with the normalized Choi matrix through conj(U) tensor V.
The conjugation on U is entrywise; it is not a conjugate transpose. -/
theorem teleportationCovariant_iff_choiCommutes
    {d e : ℕ} (hd : 0 < d) (he : 0 < e)
    (Phi : QAlgorithms.Superop (Fin d) (Fin e)) (hPhi : QAlgorithms.IsChannel Phi) :
    IsTeleportationCovariant Phi ↔
      ∀ a b : Fin d, ∃ V : Matrix.unitaryGroup (Fin e) ℂ,
        QAlgorithms.Papers.Independent.Information100.P56.normalizedChoi Phi *
            Matrix.kronecker (fun i j => star (teleportationUnitary d a b i j))
              (V : Matrix (Fin e) (Fin e) ℂ) =
          Matrix.kronecker (fun i j => star (teleportationUnitary d a b i j))
              (V : Matrix (Fin e) (Fin e) ℂ) * QAlgorithms.Papers.Independent.Information100.P56.normalizedChoi Phi := by sorry

end QAlgorithms.Papers.Independent.Dependency50.P04

end
Source
Fundamental Limits of Repeaterless Quantum Communications, arXiv:1510.08863v8, PDF p. 14, Eqs.(79)–(80)
Read-back

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

For all natural numbers d,ed,ed,e with d>0d>0d>0 and e>0e>0e>0, let Φ\PhiΦ be a function from complex d×dd\times dd×d matrices to complex e×ee\times ee×e matrices that is a channel in the following explicit sense: there exist a natural number mmm and complex e×de\times de×d matrices E0,…,Em−1E_0,\ldots,E_{m-1}E0​,…,Em−1​ such that ∑r=0m−1Er†Er=Id\sum_{r=0}^{m-1}E_r^{\dagger}E_r=I_d∑r=0m−1​Er†​Er​=Id​ and Φ(X)=∑r=0m−1ErXEr†\Phi(X)=\sum_{r=0}^{m-1}E_rXE_r^{\dagger}Φ(X)=∑r=0m−1​Er​XEr†​ for every complex d×dd\times dd×d matrix XXX. Define Ta,bT_{a,b}Ta,b​ by (Ta,b)ij=exp⁡(2πi bj/d)(T_{a,b})_{ij}=\exp(2\pi\mathrm{i}\,bj/d)(Ta,b​)ij​=exp(2πibj/d) when i=(j+a) mod di=(j+a)\bmod di=(j+a)modd, and 000 otherwise, and define the matrix JΦJ_\PhiJΦ​, indexed by pairs (i,u)(i,u)(i,u) with 0≤i<d0\le i<d0≤i<d and 0≤u<e0\le u<e0≤u<e, by

(JΦ)(i,u),(j,v)=[Φ(∣i⟩⟨j∣)]uvd,(J_\Phi)_{(i,u),(j,v)} =\frac{\bigl[\Phi(|i\rangle\langle j|)\bigr]_{uv}}{d},(JΦ​)(i,u),(j,v)​=d[Φ(∣i⟩⟨j∣)]uv​​,

where ∣i⟩⟨j∣|i\rangle\langle j|∣i⟩⟨j∣ has entry 111 at (i,j)(i,j)(i,j) and zero elsewhere. Then the following are equivalent: for every a,b∈{0,…,d−1}a,b\in\{0,\ldots,d-1\}a,b∈{0,…,d−1} there exists a unitary e×ee\times ee×e matrix VVV such that Φ(Ta,bρTa,b†)=VΦ(ρ)V†\Phi(T_{a,b}\rho T_{a,b}^{\dagger})=V\Phi(\rho)V^{\dagger}Φ(Ta,b​ρTa,b†​)=VΦ(ρ)V† for every positive semidefinite ρ\rhoρ with trace 111; and for every such a,ba,ba,b there exists a unitary e×ee\times ee×e matrix VVV such that

JΦ(Ta,b‾⊗V)=(Ta,b‾⊗V)JΦ.J_\Phi(\overline{T_{a,b}}\otimes V) =(\overline{T_{a,b}}\otimes V)J_\Phi.JΦ​(Ta,b​​⊗V)=(Ta,b​​⊗V)JΦ​.

Here the bar denotes entrywise complex conjugation, ⊗\otimes⊗ denotes the Kronecker product, and each existentially chosen VVV may depend on a,ba,ba,b.

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

    Confirmed by the moderator at approval.

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