Eqs. (6) and (8), p. 2 — a CPM is recovered from its operator: ℰ(ρ) = d² tr_{A2B2}(E ρ^T) = d⁴ tr_{A2A3B2B3}(E ρ P P)
ProvedEntanglingOps.BinaryPhase.eq_6_8choi-jamiolkowskicompletely-positive-mapp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1
Let , let each of be , and let be a completely positive map on given by a finite family of Kraus operators. Let be its operator (Eq. (4)), with of Eq. (5). Then for every operator :
- (Eq. (8))
- (Eq. (6))
Here , and denote the same operator on different pairs of systems, and is the transpose in the basis .
Equation (6) says that whoever holds the operator as a state can produce on any input by a joint projection of and 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.