§2.2 theorem II; §A.2: normalized operator-sum representation
ProvedQAlgorithms.Papers.Independent.Support50.P41.operatorSumRepresentationprove2quantum
For a complex-linear completely positive trace-preserving map on , , there are matrices such that
The normalization is part of the representation theorem.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF pp.5--6,32--34, theorem II: normalized operator-sum representation from independent CP and TP. -/
theorem operatorSumRepresentation {d : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace) :
∃ m : ℕ, m ≤ d^2 ∧ ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
OperatorSum Phi A := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 6, §2.2 theorem II; §A.2: normalized operator-sum representation
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every integer and every complex-linear map that preserves the trace of every matrix and is completely positive—its blockwise amplification preserves positive semidefiniteness for every integer —there exist an integer and matrices such that
There is no explicit positive lower bound on , but would make the first equality , which is impossible because .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.