Preprint
Sep 2026
Quantum circuit compilation with constant overhead
Compiling a continuous gate set to a discrete universal gate set generally incurs an overhead. A circuit composed of $G$ arbitrary one- and two-qubit gates can be $\epsilon$-approximated by a sequence of gates from $\{H,T,\mathrm{CNOT}\}$ by replacing each original gate by a sequence of $O(\log(G/\epsilon))$ elementary...
Chen-Yi Zhang, Xin-Yu Tan, Robin Kothari et al.
· 0 citations