The Solovay-Kitaev theorem for Clifford+T words, with the Dawson-Nielsen exponent
Source: github.com/zblore/solovay-kitaev-lean/tree/4579418fe09fefdf…
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-17-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-17-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-17-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'