§A.4: unitary mixing of two operator-sum representations
ProvedQAlgorithms.Papers.Independent.Support50.P41.krausUnitaryFreedomLet and be normalized operator-sum representations of the same channel on a nonzero finite-dimensional system. Append zero operators to both lists to obtain length . There exists a unitary matrix with
The unitary acts on representation labels and has the printed orientation without an extra complex conjugation.
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.36--37: zero padding and printed orientation of the unitary mixing of Kraus labels. -/
theorem krausUnitaryFreedom {d m n : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d))
(A : Fin m → Matrix (Fin d) (Fin d) ℂ) (hA : OperatorSum Phi A)
(B : Fin n → Matrix (Fin d) (Fin d) ℂ) (hB : OperatorSum Phi B) :
∃ U : Matrix.unitaryGroup (Fin (max m n)) ℂ,
∀ k : Fin (max m n), padKraus A (max m n) k =
∑ l, (U : Matrix (Fin (max m n)) (Fin (max m n)) ℂ) k l •
padKraus B (max m n) l := 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 , every natural numbers , every function , and matrix families and , suppose
Set , and extend each family to length by setting when and otherwise, and when and otherwise. There exists a unitary matrix such that
Although and are included in the quantification, either value makes its corresponding normalization hypothesis impossible because .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.