Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (6) and (8), p. 2 — a CPM is recovered from its operator: ℰ(ρ) = d² tr_{A2B2}(E ρ^T) = d⁴ tr_{A2A3B2B3}(E ρ P P)

Proved
EntanglingOps.BinaryPhase.eq_6_8

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

choi-jamiolkowskicompletely-positive-mapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1

Let d≥1d\ge1d≥1, let each of A1,A2,A3,B1,B2,B3A_1,A_2,A_3,B_1,B_2,B_3A1​,A2​,A3​,B1​,B2​,B3​ be Cd\mathbb C^dCd, and let E(ρ)=∑kOkρOk†\mathcal E(\rho)=\sum_kO_k\rho O_k^\daggerE(ρ)=∑k​Ok​ρOk†​ be a completely positive map on A1B1A_1B_1A1​B1​ given by a finite family of Kraus operators. Let EA1A2,B1B2=E(PA1A2⊗PB1B2)E_{A_1A_2,B_1B_2}=\mathcal E(P_{A_1A_2}\otimes P_{B_1B_2})EA1​A2​,B1​B2​​=E(PA1​A2​​⊗PB1​B2​​) be its operator (Eq. (4)), with P=∣Φ⟩⟨Φ∣P=|\Phi\rangle\langle\Phi|P=∣Φ⟩⟨Φ∣ of Eq. (5). Then for every operator ρ\rhoρ:

  1. (Eq. (8))
E(ρA1B1)=d2tr⁡A2B2 ⁣(EA1A2,B1B2 ρA2B2T);\mathcal E(\rho_{A_1B_1})=d^2\operatorname{tr}_{A_2B_2}\!\big(E_{A_1A_2,B_1B_2}\,\rho^T_{A_2B_2}\big);E(ρA1​B1​​)=d2trA2​B2​​(EA1​A2​,B1​B2​​ρA2​B2​T​);
  1. (Eq. (6))
E(ρA1B1)=d4tr⁡A2A3B2B3 ⁣(EA1A2,B1B2 ρA3B3 PA2A3PB2B3).\mathcal E(\rho_{A_1B_1})=d^4\operatorname{tr}_{A_2A_3B_2B_3}\!\big(E_{A_1A_2,B_1B_2}\,\rho_{A_3B_3}\,P_{A_2A_3}P_{B_2B_3}\big).E(ρA1​B1​​)=d4trA2​A3​B2​B3​​(EA1​A2​,B1​B2​​ρA3​B3​​PA2​A3​​PB2​B3​​).

Here ρA1B1\rho_{A_1B_1}ρA1​B1​​, ρA3B3\rho_{A_3B_3}ρA3​B3​​ and ρA2B2\rho_{A_2B_2}ρA2​B2​​ denote the same operator on different pairs of systems, and TTT is the transpose in the basis SA2⊗SB2S_{A_2}\otimes S_{B_2}SA2​​⊗SB2​​.

Equation (6) says that whoever holds the operator EEE as a state can produce E\mathcal EE on any input by a joint projection of A2A3A_2A_3A2​A3​ and B2B3B_2B_3B2​B3​ onto maximally entangled states; this is the mechanism of the paper's protocol.

Differences from the source:

  • generalization: ρ a state → every complex matrix ρ; reason: both identities are linear in ρ; states are a special case
  • encoding: a completely positive map ℰ on A1B1 → the map ρ ↦ ∑_k O_k ρ O_k† of a finite Kraus family O : κ → Matrix; reason: every CPM on a finite-dimensional space has a finite Kraus decomposition and every such family defines a CPM; same instances
  • encoding: operators on the six systems → matrices on ((a1,b1),(a2,b2)) for (8) and on ((a1,b1),((a2,b2),(a3,b3))) for (6), via regroup and Equiv.prodAssoc; partial traces by partialTraceRight; reason: Lean carrier convention; same operators
  • encoding: dimension d = dim ℋ with basis |1⟩,…,|d⟩ → hypothesis 0 < d on d : ℕ; reason: nondegeneracy only; a Hilbert space with the page's basis S has d ≥ 1, and at d = 0 every matrix is empty
Preamble
import Mathlib
import Definitions.Def_EntanglingOps_BinaryPhase_Model
Formal statement
namespace EntanglingOps.BinaryPhase

open Matrix
open scoped Kronecker

/-- Eqs. (8) and (6), p. 2: a completely positive map `ℰ(ρ) = ∑_k O_k ρ O_k†` on `A₁B₁` is
recovered from its operator `E = choiOp O` of Eq. (4):
(8) `ℰ(ρ_{A₁B₁}) = d² tr_{A₂B₂}(E_{A₁A₂,B₁B₂} ρ^T_{A₂B₂})`, on the carrier `((a₁, b₁), (a₂, b₂))`;
(6) `ℰ(ρ_{A₁B₁}) = d⁴ tr_{A₂A₃B₂B₃}(E_{A₁A₂,B₁B₂} ρ_{A₃B₃} P_{A₂A₃} P_{B₂B₃})`, on the carrier
`((a₁, b₁), ((a₂, b₂), (a₃, b₃)))`. In both, `ρ` on the right is the same matrix as on the left,
placed on `A₂B₂` (transposed) or `A₃B₃`. Stated for every matrix `ρ`. -/
theorem eq_6_8 (d : ℕ) (hd : 0 < d) {κ : Type} [Fintype κ]
    (O : κ → Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ)
    (ρ : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) :
    krausMap O ρ = ((d : ℂ) ^ 2) • WildeQIT.partialTraceRight
        (reindex (regroup d) (regroup d) (choiOp O) *
          ((1 : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) ⊗ₖ ρᵀ)) ∧
    krausMap O ρ = ((d : ℂ) ^ 4) • WildeQIT.partialTraceRight
        (reindex (Equiv.prodAssoc (Fin d × Fin d) (Fin d × Fin d) (Fin d × Fin d))
            (Equiv.prodAssoc (Fin d × Fin d) (Fin d × Fin d) (Fin d × Fin d))
            (reindex (regroup d) (regroup d) (choiOp O) ⊗ₖ
              (1 : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ)) *
          ((1 : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) ⊗ₖ
            (((1 : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ) ⊗ₖ ρ) * projPhiPair d))) := by sorry

end EntanglingOps.BinaryPhase
Source
Cirac, Dür, Kraus, Lewenstein, Entangling operations and their implementation using a small amount of entanglement, arXiv:quant-ph/0007057v1, p. 2, Eqs. (6) and (8)
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 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