Proposition 4.3 / (39): four dimension-independent error comparisons
OpenQAlgorithms.Papers.Independent.Gap20.P07.fourErrorComparisonsLet be a CPTP endomorphism of a finite-dimensional nonzero complex system. Let be the minimum normalized pure-state fidelity, the infimum of squared entanglement fidelity over density operators, , and , with the full trace norm convention. Then
Every constant and the fourth root are dimension independent. This chain explains equivalence of these four error criteria near an ideal channel.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P07
noncomputable section
open Filter MeasureTheory
open scoped Topology ENNReal NNReal Matrix ComplexOrder ComplexConjugate
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
attribute [local instance] IsStarNormal.instContinuousFunctionalCalculus
namespace QAlgorithms.Papers.Independent.Gap20.P07
open QAlgorithms
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33
(State IsTraceClass IsTraceClassChannel traceSize rankOne tensorApply)
open QAlgorithms.Papers.Independent.Frontier30.P14
(Operation isometryCoeff conjugateKernel)
open QAlgorithms.Papers.Independent.Claimed50.P35
(stabilizedTraceClassNorm traceClassTensorMap traceClassChannelPower
transpose transposeBound TraceLinear tracePair MeasurePrepare)
open QAlgorithms.Papers.Independent.Gap48.P29 (fe FiniteCPMap)
/-- PDF pp.13--14, Proposition 4.3, (39): the complete four-inequality chain,
with constants 4,4,4,8 and the final fourth root. -/
theorem fourErrorComparisons (d : ℕ) (hd : 0 < d)
(T : Superop (Fin d) (Fin d)) (hT : IsChannel T) :
1 - minimumFe d T ≤ 4 * Real.sqrt (1 - minimumFidelity d T) ∧
4 * Real.sqrt (1 - minimumFidelity d T) ≤ 4 * Real.sqrt (ordinaryNorm d (fun X => T X - X)) ∧
4 * Real.sqrt (ordinaryNorm d (fun X => T X - X)) ≤ 4 * Real.sqrt (finiteCbNorm d (fun X => T X - X)) ∧
4 * Real.sqrt (finiteCbNorm d (fun X => T X - X)) ≤
8 * Real.rpow (1 - minimumFe d T) (1 / 4 : ℝ) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every positive integer and every map with a finite Kraus representation satisfying , put and define
where, writing for a matrix unit,
For a map define , where . To define the other norm appearing in the statement, let be the infimum, in , of over sequences in the appropriate space such that is summable and ; a matrix is called trace class when such an expansion exists, and the infimum over no expansions is . Set
where , including the empty set for , and conversion to a real number sends to . With , all four inequalities hold:
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.