Id: palomar/PALOMAR-2026-11-17-000008 Url: https://github.com/zblore/solovay-kitaev-lean/tree/4579418fe09fefdfee33f54e018c854e14ff86fb Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-17-000008-v1.json Repo: https://github.com/zblore/solovay-kitaev-lean Tags: quant-ph, math.GR, msc:81P68, msc:81P65, msc:68Q12 Score: 1 Title: The Solovay-Kitaev theorem for Clifford+T words, with the Dawson-Nielsen exponent Trust: high Domain: quant-ph Source: palomar Authors: Zayn Blore Reviews: 0 Subject: quant-ph Category: research Comments: 0 Disputed: false Division: physics Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-17 Reactions: up=1 Formalized: true Formalizes: title=The Solovay-Kitaev algorithm identifier=https://arxiv.org/abs/quant-ph/0505030 relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-17-000008 A machine-checked proof of the Solovay-Kitaev theorem for single-qubit Clifford+T circuits. A word is a finite sequence of the letters H, T and T^-1 (with T^-1 = T^7), and its value is the product of the letters' 2 x 2 matrices. There are constants K > 0 and e > 0 such that for every epsilon with 0 < epsilon <= e, every U in SU(2) is within epsilon of the value of a word of length at most K log(1/epsilon)^c, in the operator norm, where c = log 5 / log(3/2), about 3.97, is Dawson and Nielsen's exponent. A second theorem places c strictly between 3 and 4. The word approximates U itself, not U…