§5.1: minimal orthogonal representation at maximally mixed input
ProvedQAlgorithms.Papers.Independent.Support50.P41.orthogonalMinimalKrausEvery CPTP map on a nonzero finite-dimensional system has a normalized Kraus representation of nonzero Hilbert--Schmidt orthogonal operators. Furthermore, every such representation is minimal:
for every other Kraus representation with terms, where is the size of . These are the diagonal representations at maximally mixed input after discarding zero operators.
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.21: a nonzero orthogonal Kraus family exists and is minimal; read in the maximally mixed case. -/
theorem orthogonalMinimalKraus {d : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi) :
(∃ m : ℕ, ∃ A : Fin m → Matrix (Fin d) (Fin d) ℂ,
OperatorSum Phi A ∧ (∀ k, A k ≠ 0) ∧
∀ k l, k ≠ l → ((A k)ᴴ * A l).trace = 0) ∧
∀ m (A : Fin m → Matrix (Fin d) (Fin d) ℂ), OperatorSum Phi A →
(∀ k, A k ≠ 0) → (∀ k l, k ≠ l → ((A k)ᴴ * A l).trace = 0) →
∀ n (B : Fin n → Matrix (Fin d) (Fin d) ℂ), OperatorSum Phi B → m ≤ n := 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 map admitting a finite representation with , there exist a natural number and matrices , , satisfying
Furthermore, for every natural number and every family satisfying all these conditions, every natural number and family satisfying and for all obey ; no nonzero or orthogonality condition is imposed on . Both family sizes range over all natural numbers, although an empty complete family is impossible when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.