§A.2: at most d squared Kraus terms for a CP map
ProvedQAlgorithms.Papers.Independent.Support50.P41.cpKrausBoundLet be any complex-linear completely positive map, with . There are matrices such that
Trace preservation and Kraus normalization are not required; the zero map is included. This is the broader CP representation statement in the appendix.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
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 p.34: at most d squared Kraus terms for CP maps, without TP or nonzero-map hypotheses. -/
theorem cpKrausBound {d : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) :
∃ m : ℕ, m ≤ d^2 ∧ ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
∀ X, Phi X = krausApply A X := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer and every complex-linear map , suppose is completely positive: for every natural number , including , applying to each block of any positive semidefinite matrix indexed by produces a positive semidefinite matrix. Then there exist a natural number and matrices such that, for every complex matrix ,
No trace-preservation hypothesis or condition is asserted. The value is allowed; its empty sum represents the zero map.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.