Typical-Case Gate Approximation and Arithmetic Obstructions in Quaternionic Single-Qubit Compilation

Kingsley Yeon, Steven B. Damelin, Alec Greene

Fault-tolerant quantum computation requires compiling arbitrary one-qubit unitaries into short words over a fixed gate library. For arithmetic libraries such as the $p=5$ Lubotzky-…