Section IV A: stability of process-matrix distances
ProvedQAlgorithms.Papers.Independent.Advance50.P17.proStabilityLet a finite-register state-distance family be invariant under canonical basis reindexing and adjoining the same normalized tensor factor. For any fixed CPTP maps and any positive finite ancilla , the normalized reference-first Choi construction satisfies
This identity holds in particular for , and squared process fidelity is also stable. Tensor-factor orders are identified by their canonical permutation.
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 p.5: process distances inherit state tensor stability after the canonical
reference-first tensor permutation; this includes the four metrics and squared F_pro itself. -/
theorem proStability (delta : FiniteStateDistance) (hs : StateStable delta) (E F : FiniteProcess I I) :
proDistance delta (idTensorSuperop (R := J) E.val) (idTensorSuperop (R := J) F.val) =
proDistance delta E.val F.val ∧
(∀ c : Choice, proDistance (stateDistance c) (idTensorSuperop (R := J) E.val)
(idTensorSuperop (R := J) F.val) = proDistance (stateDistance c) E.val F.val) ∧
proFidelity (idTensorSuperop (R := J) E.val) (idTensorSuperop (R := J) F.val) =
proFidelity E.val F.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 finite nonempty types with decidable equality, and let be a real-valued family of functions on pairs of complex square matrices indexed by arbitrary finite types with decidable equality. Assume both that adjoining any positive semidefinite trace-one matrix preserves , so that , and that simultaneously reindexing along any equivalence of finite nonempty index types preserves ; these assumptions hold for every choice of the relevant types and positive semidefinite trace-one matrices. Let be channels on , meaning maps with finite Kraus representations whose Kraus operators satisfy . For any finite nonempty type , define if , and otherwise, , , and , where . The map applies to each matrix block with fixed two -indices. Then
Moreover, the same equality holds for each of the four state functions
and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.