Eq. (33), pp. 11–13 — balanced approximate group commutators in SU(d)
ProvedSKAlgorithm.Qudit.eq_33Fix . There are constants and such that for every and every with there exist with
This is the guarantee of GC-Approx-Decompose in the qudit algorithm: a gate near the identity is approximated, to order , by a group commutator of two gates at distance from the identity. The paper's constants are and .
Formalization Note. The constants are existential, chosen before and , and may depend on ; the approximate values are not pinned. and are required to lie in , since the algorithm recurses on them. The paper's derivation on pp. 12–13 contains a sign slip: with and , Lemma 3 gives , not . The statement of Eq. (33) is nevertheless true (apply Lemma 2 to , or exchange and ), and it is stated as the paper claims it.
import Mathlib import Definitions.Def_SKAlgorithm_Qudit_Model open scoped Matrix open QAlgorithms
namespace SKAlgorithm.Qudit
theorem eq_33 (d : ℕ) :
∃ c' c'' : ℝ, 0 < c' ∧ 0 < c'' ∧ ∀ ε : ℝ, 0 < ε → ∀ U : SU d, opDist 1 U < ε →
∃ V W : SU d, opDist (V * W * V⁻¹ * W⁻¹) U < c' * ε ^ ((3 : ℝ) / 2) ∧
opDist 1 V < c'' * Real.sqrt ε ∧ opDist 1 W < c'' * Real.sqrt ε := by sorry
end SKAlgorithm.Qudit
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.