p. 12 — a gate near the identity is exp(iH), H traceless Hermitian, with d(I, U) = ‖H‖ + O(‖H‖³)
ProvedSKAlgorithm.Qudit.log_near_identityFix . There are constants and such that every with can be written with a traceless Hermitian matrix of operator norm satisfying
i.e. .
This is the first step of the paper's balanced commutator construction in : it turns a gate close to the identity into a small generator to which Lemma 2 applies.
Formalization Note. Two clauses are made explicit. (1) : the paper does not say it on p. 12, but Lemma 2 is applied to and requires it; it holds because and the eigenvalues of a small are small. (2) : p. 3 states the expansion under the proviso that the eigenvalues of lie between and ; without it, could be shifted by multiples of to a large logarithm, for which the estimate holds trivially. The constants and may depend on . The printed "U exp(iH)" is read as "U = exp(iH)".
import Mathlib import Definitions.Def_SKAlgorithm_Qudit_Model open scoped Matrix open QAlgorithms
namespace SKAlgorithm.Qudit
theorem log_near_identity (d : ℕ) :
∃ ε₁ K : ℝ, 0 < ε₁ ∧ 0 < K ∧ ∀ U : SU d, opDist 1 U < ε₁ →
∃ H : Matrix (Fin d) (Fin d) ℂ, H.IsHermitian ∧ H.trace = 0 ∧ specNorm H < Real.pi ∧
(U : Matrix (Fin d) (Fin d) ℂ) = NormedSpace.exp (Complex.I • H) ∧
|opDist 1 U - specNorm H| ≤ K * specNorm H ^ 3 := by sorry
end SKAlgorithm.Qudit
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.