{"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","summary":"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…","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"}]}