Balanced Lie brackets for small SU(2) logarithms
ProvedQAlgorithms.Childs.su2_balanced_lie_bracketquantum-informationsolovay-kitaevunitary-groups
Let , with the spectral norm. There is such that, whenever and , there are complex matrices with
This is the exact Lie-algebra representation underlying the balanced small-commutator construction. It separates the finite-dimensional geometry of from the analytic error in replacing the exponential of a Lie bracket by a group commutator. The fixed factor provides slack for controlling the distances of the exponential factors from the identity.
Preamble
import Definitions.Def_QAlgorithms_Defs_Circuit set_option autoImplicit false
Formal statement
theorem QAlgorithms.Childs.su2_balanced_lie_bracket :
∃ ε₀ : ℝ, 0 < ε₀ ∧ ∀ ε : ℝ, 0 < ε → ε ≤ ε₀ →
∀ A ∈ QAlgorithms.su2Ball (ε ^ 2),
∃ X Y : Matrix (Fin 2) (Fin 2) ℂ,
QAlgorithms.specNorm X ≤ (3 / 4 : ℝ) * ε ∧
QAlgorithms.specNorm Y ≤ (3 / 4 : ℝ) * ε ∧
NormedSpace.exp X ∈ Matrix.specialUnitaryGroup (Fin 2) ℂ ∧
NormedSpace.exp Y ∈ Matrix.specialUnitaryGroup (Fin 2) ℂ ∧
(A : Matrix (Fin 2) (Fin 2) ℂ) = NormedSpace.exp (X * Y - Y * X) := by sorry
Source
Andrew M. Childs, Lecture Notes on Quantum Algorithms, 17 April 2025, §2.4 printed p.9 (PDF page17), proof of Lemma2.3: shortest Pauli logarithm and facts(i),(iii), and the perpendicular equal-length cross-product construction before (2.10). The fixed3/4 slack follows from fact(i) and 1/sqrt(2)<3/4. https://www.cs.umd.edu/~amchilds/qa/qa.pdf