Section IV A, Eqs.(7)–(9): process-matrix chaining with a unital ideal first step
ProvedQAlgorithms.Papers.Independent.Advance50.P17.proChainingLet be a state-metric family contractive under finite-dimensional CPTP maps. Let be CPTP maps on a positive finite-dimensional system, and assume . For normalized Choi-state distances,
Only the first ideal step must be unital; the second ideal step may be any CPTP map.
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P17
noncomputable section
open MeasureTheory Filter
open scoped Matrix ComplexConjugate Topology
namespace QAlgorithms.Papers.Independent.Advance50.P17
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P75 (hermitianReal)
variable {I J K : Type} [Fintype I] [Fintype J] [Fintype K]
[DecidableEq I] [DecidableEq J] [DecidableEq K]
[Nonempty I] [Nonempty J] [Nonempty K]
/-- Section IV A, PDF pp.5--6, Eqs.(7)--(9): chaining requires the IDEAL FIRST step to be unital.
F2 is arbitrary CPTP. The Section VI abbreviation does not remove this condition. -/
theorem proChaining (delta : FiniteStateDistance) (hm : StateMetrics delta)
(hc : StateContractive delta) (E1 F1 E2 F2 : FiniteProcess I I) (hu : F1.val 1 = 1) :
proDistance delta (E2.val ∘ E1.val) (F2.val ∘ F1.val) ≤
proDistance delta E2.val F2.val + proDistance delta E1.val F1.val := by sorry
end QAlgorithms.Papers.Independent.Advance50.P17
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a finite nonempty type with decidable equality, and let assign real values to pairs of complex square matrices on every finite type with decidable equality. Assume that on positive semidefinite trace-one matrices of every finite nonempty index type, is nonnegative, vanishes exactly on equality, is symmetric, and satisfies the triangle inequality. Also assume that for every channel between any finite nonempty index types and every pair of positive semidefinite trace-one inputs, . Here channels admit finite representations with . Let be channels on , and assume . With for and otherwise, define , where the tensor extension applies to each block with fixed reference indices, and set . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.