§5.1: diagonal operator-sum representation for a specified input
ProvedQAlgorithms.Papers.Independent.Support50.P41.diagonalKrausprove2quantum
For every density matrix and CPTP map on a nonzero finite-dimensional system, there exists a normalized Kraus representation with
Thus the exchange matrix can be diagonalized by choosing the representation. No full-rank assumption on or global minimality is asserted.
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 p.21: existence of an input-dependent diagonal representation; no minimality for singular inputs. -/
theorem diagonalKraus {d : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
∃ m : ℕ, ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
OperatorSum Phi A ∧ ∀ k l, k ≠ l → (A k * rho * (A l)ᴴ).trace = 0 := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 21, §5.1: diagonal operator-sum representation for a specified input
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer , every map that admits a finite representation with , and every positive semidefinite matrix with , there exist a natural number and matrices such that
The quantified number is allowed syntactically to be zero, but the completeness identity excludes that case because .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.