recognitionQuantum_pos

formal source

  31theorem recognitionQuantum_eq_Jph : recognitionQuantum = Jcost phi := by
  32  rw [recognitionQuantum, Jcost_phi_val]
  33
  34theorem recognitionQuantum_pos : 0 < recognitionQuantum := by
  35  unfold recognitionQuantum; linarith [phi_gt_onePointFive]
  36
  37/-- RS prediction for surface code threshold: J(φ) / 10. -/
  38def surfaceCodeThreshold : ℝ := recognitionQuantum / 10
  39
  40theorem surfaceCodeThreshold_pos : 0 < surfaceCodeThreshold := by
  41  unfold surfaceCodeThreshold; exact div_pos recognitionQuantum_pos (by norm_num)
  42
  43/-- J-cost on the physical error rate ratio. -/
  44def errorRateCost (actual_rate threshold_rate : ℝ) : ℝ :=
  45  Jcost (actual_rate / threshold_rate)
  46
  47theorem errorRateCost_at_threshold (r : ℝ) (h : r ≠ 0) :
  48    errorRateCost r r = 0 := by
  49  unfold errorRateCost; rw [div_self h]; exact Jcost_unit0
  50
  51theorem errorRateCost_nonneg (a t : ℝ) (ha : 0 < a) (ht : 0 < t) :
  52    0 ≤ errorRateCost a t := by
  53  unfold errorRateCost; exact Jcost_nonneg (div_pos ha ht)
  54
  55structure ErrorCorrectionCert where
  56  threshold_pos : 0 < surfaceCodeThreshold
  57  cost_at_threshold : ∀ r : ℝ, r ≠ 0 → errorRateCost r r = 0
  58  cost_nonneg : ∀ a t : ℝ, 0 < a → 0 < t → 0 ≤ errorRateCost a t
  59
  60noncomputable def cert : ErrorCorrectionCert where
  61  threshold_pos := surfaceCodeThreshold_pos
  62  cost_at_threshold := errorRateCost_at_threshold
  63  cost_nonneg := errorRateCost_nonneg
  64