Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Qubit channel fidelity in Kraus and Liouville form

Open
QAlgorithms.Papers.Independent.Intakenext100.P65.channelFidelity_identity

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

prove2quantum

Let A1,…,A4A_1,\ldots,A_4A1​,…,A4​ be 2×22\times22×2 complex matrices with ∑kAk†Ak=I\sum_k A_k^\dagger A_k=I∑k​Ak†​Ak​=I, and put E(ρ)=∑kAkρAk†\mathcal E(\rho)=\sum_k A_k\rho A_k^\daggerE(ρ)=∑k​Ak​ρAk†​. Zero Kraus operators are allowed. Let ρE=(E⊗I)(∣Ψ⟩⟨Ψ∣)\rho_{\mathcal E}=(\mathcal E\otimes I)(|\Psi\rangle\langle\Psi|)ρE​=(E⊗I)(∣Ψ⟩⟨Ψ∣), where ∣Ψ⟩=(∣00⟩+∣11⟩)/2|\Psi\rangle=(|00\rangle+|11\rangle)/\sqrt2∣Ψ⟩=(∣00⟩+∣11⟩)/2​. Let Lij=12Tr⁡(σiE(σj))L_{ij}=\tfrac12\operatorname{Tr}(\sigma_i\mathcal E(\sigma_j))Lij​=21​Tr(σi​E(σj​)), with σ0=I\sigma_0=Iσ0​=I and the usual three Pauli matrices. Then

FE=⟨Ψ∣ρE∣Ψ⟩=14∑k=14∣Tr⁡Ak∣2=14Tr⁡L.F_E=\langle\Psi|\rho_{\mathcal E}|\Psi\rangle=\frac14\sum_{k=1}^4|\operatorname{Tr}A_k|^2=\frac14\operatorname{Tr}L.FE​=⟨Ψ∣ρE​∣Ψ⟩=41​k=1∑4​∣TrAk​∣2=41​TrL.

The normalized Choi trace is one; it is not the Liouville trace appearing in this identity. The oscillator implementation needs no finite Fock cutoff for this finite effective-channel identity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P65
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P65

open MeasureTheory Filter

open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)

open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)

open scoped ComplexConjugate Matrix Topology

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF p.3 (1.11): both Kraus and Liouville formulas, under the squared overlap convention. -/
theorem channelFidelity_identity (A : Fin 4 → Matrix (Fin 2) (Fin 2) ℂ)
    (hA : IsKrausFamily A) :
    QuditFidelity.entanglementFidelity 2 (by decide) (krausApply A) =
      (∑ k, Complex.normSq ((A k).trace)) / 4 ∧
    QuditFidelity.entanglementFidelity 2 (by decide) (krausApply A) =
      (liouville (krausApply A)).trace.re / 4 ∧
    QuditFidelity.entanglementFidelity 2 (by decide) (krausApply A) =
      effectProb (pureDensity (finiteMaxEntangled (Fin 2))) ((1 / 2 : ℂ) • outputFirstChoi (krausApply A)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P65

end
Source
Performance and structure of single-mode bosonic codes, arXiv:1708.05010v3, PDF p. 3, §I B (1.11): channel fidelity in Kraus and Liouville form
Read-back

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

For every family of four complex 2×22\times22×2 matrices A0,A1,A2,A3A_0,A_1,A_2,A_3A0​,A1​,A2​,A3​ satisfying ∑k=03Ak†Ak=I2\sum_{k=0}^3A_k^\dagger A_k=I_2∑k=03​Ak†​Ak​=I2​, let T(X)=∑k=03AkXAk†T(X)=\sum_{k=0}^3A_kXA_k^\daggerT(X)=∑k=03​Ak​XAk†​, let ϕ=(∣00⟩+∣11⟩)/2\phi=(|00\rangle+|11\rangle)/\sqrt2ϕ=(∣00⟩+∣11⟩)/2​, and put Φ=ϕϕ†\Phi=\phi\phi^\daggerΦ=ϕϕ†. Define Fe(T)=Re⁡tr⁡(Φ(id⊗T)(Φ))F_e(T)=\operatorname{Re}\operatorname{tr}(\Phi(\mathrm{id}\otimes T)(\Phi))Fe​(T)=Retr(Φ(id⊗T)(Φ)), where id⊗T\mathrm{id}\otimes Tid⊗T applies TTT to each block indexed by the first subsystem. Let (JT)(o,i),(p,j)=T(Eij)op(J_T)_{(o,i),(p,j)}=T(E_{ij})_{op}(JT​)(o,i),(p,j)​=T(Eij​)op​, where EijE_{ij}Eij​ are the 2×22\times22×2 matrix units. All three equalities hold:

Fe(T)=14∑k=03∣tr⁡Ak∣2,Fe(T)=14Re⁡tr⁡LT,Fe(T)=Re⁡tr⁡ ⁣(Φ JT2),F_e(T)=\frac14\sum_{k=0}^3|\operatorname{tr}A_k|^2,\qquad F_e(T)=\frac14\operatorname{Re}\operatorname{tr}L_T,\qquad F_e(T)=\operatorname{Re}\operatorname{tr}\!\left(\Phi\,\frac{J_T}{2}\right),Fe​(T)=41​k=0∑3​∣trAk​∣2,Fe​(T)=41​RetrLT​,Fe​(T)=Retr(Φ2JT​​),

where (LT)kl=12tr⁡(PkT(Pl))(L_T)_{kl}=\tfrac12\operatorname{tr}(P_kT(P_l))(LT​)kl​=21​tr(Pk​T(Pl​)), with P0=I2P_0=I_2P0​=I2​, P1=(0110)P_1=\left(\begin{smallmatrix}0&1\\1&0\end{smallmatrix}\right)P1​=(01​10​), P2=(0−ii0)P_2=\left(\begin{smallmatrix}0&-\mathrm i\\\mathrm i&0\end{smallmatrix}\right)P2​=(0i​−i0​), and P3=diag⁡(1,−1)P_3=\operatorname{diag}(1,-1)P3​=diag(1,−1).

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