@misc{kliuchnikov2026direct,
author = {Kliuchnikov, Vadym and Brachter, Jendrik and Silva, M.},
title = {Direct U(2) approximation via repeat-until-success circuits},
howpublished = {arXiv},
year = {2026},
month = {April},
abstract = {We show how to directly and efficiently approximate arbitrary one-qubit unitaries, bypassing the Euler decomposition and the magnitude approximation problem, at the cost of one ancillary qubit. Our technique also applies to approximating unitaries with multi-qubit gate sets such as Clifford and CS, or Clifford and CCZ, as well as to approximating orthogonal matrices using multi-qubit gate sets such as Real Clifford and CCZ. The key tools are repeat-until-success circuits, lattice-based exact synthesis algorithms, integer point enumeration in convex sets, and relative norm equations.},
url = {http://approjects.co.za/?big=en-us/research/publication/direct-u2-approximation-via-repeat-until-success-circuits/},
}