Section V A, Eq.(21), Appendix B2: average function error controlled by J distance
ProvedQAlgorithms.Papers.Independent.Advance50.P17.averageFunctionErrorLet be fixed CPTP maps on a -dimensional system, , with all computational basis inputs equally likely, and let be the desired basis outcome. Define . Then
The process distance uses normalized Choi states. This concerns a finite uniform input average, not Haar inputs or a freely chosen input distribution.
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 V A, PDF p.9, Eq.(21), Appendix B2, pp.13--14: uniform finite-input mean error. -/
theorem averageFunctionError (E F : FiniteProcess I I) (f : I → I) :
meanError E.val f ≤ meanError F.val f + proDistance (stateDistance .trace) 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 a finite nonempty index type with decidable equality, let be channels on its complex matrices, and let be any function. Here a channel has a finite Kraus representation satisfying . For standard basis vectors , define
Let have amplitude at and amplitude at when , and set , where identity extension applies separately to each reference-indexed matrix block. Then
where the square root is matrix functional calculus.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.