Section I: post-processing contractivity from metric and chaining
ProvedQAlgorithms.Papers.Independent.Advance50.P17.postprocessingLet be a family of metrics on finite-dimensional CPTP maps, satisfying chaining for all compatible compositions. For any fixed CPTP maps and , with all registers of positive finite dimension,
Thus post-processing cannot increase process distinguishability.
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 I, PDF p.2: metric and chaining imply contractivity under arbitrary compatible
CPTP post-processing. The metric family is fixed before the processes. -/
theorem postprocessing (delta : ProcessDistance) (hm : ProcessMetrics delta)
(hc : ProcessChaining delta) (E F : FiniteProcess I J) (R : FiniteProcess J K) :
delta (R.val ∘ E.val) (R.val ∘ F.val) ≤ delta 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 assign a real number to each pair of maps between complex square-matrix spaces over any finite input and output index types with decidable equality. Assume that on channels between every pair of nonempty such types, is nonnegative, vanishes exactly when the channels are equal, is symmetric, and satisfies the triangle inequality. Assume also that for all nonempty finite types with decidable equality and channels and , where these arrows denote maps between the corresponding matrix spaces,
Here a channel means a map admitting finitely many complex matrices with and for every matrix . Then, for any nonempty finite types with decidable equality, channels , and a channel ,
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.