§A.4: Kraus representations and Choi-state vector ensembles
ProvedQAlgorithms.Papers.Independent.Support50.P41.krausEnsembleCorrespondenceFix a complex-linear CPTP map on dimension and a countable label set , including any finite set. Let be its unnormalized input-first Choi operator. The coordinate map from a matrix family to is bijective, and
All series are convergent operator sums. This is a correspondence of indexed subnormalized vectors, preserving phases and zero entries, rather than unordered ensembles of rays.
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 pp.33--34,36: indexed subnormalized-vector ensembles of D/d correspond bijectively to Kraus lists. -/
theorem krausEnsembleCorrespondence {K : Type*} [Countable K] {d : ℕ} [NeZero d]
(Phi : Matrix (Fin d) (Fin d) ℂ →ₗ[ℂ] Matrix (Fin d) (Fin d) ℂ)
(hCP : IsCompletelyPositive Phi) (hTP : ∀ X, (Phi X).trace = X.trace) :
Function.Bijective (fun A : K → Matrix (Fin d) (Fin d) ℂ =>
fun k => normalizedOperatorVector (A k)) ∧
∀ A : K → Matrix (Fin d) (Fin d) ℂ,
CountableOperatorSum Phi A ↔
HasSum (fun k => pureDensity (normalizedOperatorVector (A k)))
(((d : ℂ)⁻¹) • choi Phi) := 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 countable type , which may be finite or empty, every positive integer , and every complex-linear map , assume that is completely positive, meaning that its action on the blocks preserves positive semidefiniteness for every finite ancillary dimension, including zero, and that for every complex matrix . For a matrix , define the vector , with coordinates ordered as input then output, by , and define , where is the matrix unit. The assignment is bijective between all -indexed matrix families and all -indexed vectors in ; these vectors are not required individually to have norm one. Moreover, for every family , the following equivalence holds:
Each sum here asserts convergence of the unordered finite partial sums to the displayed value, and . For empty , the family assignment remains bijective, while both sides of the equivalence are false under the stated hypotheses.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.