pygridsynth provides O(log(1/ε)) ancilla-free Clifford+T synthesis with a new partial-decomposition technique for n≥3 reducing T-count constants to (21/8·4^n - 9/2·2^n + 9)log₂(1/ε) + o(log(1/ε)) and a mixed-synthesis approach empirically lowering error to ε²/(2n).
Optimal quantum circuits for general two-qubit gates.Physical Review A, 69(3):032315
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
Reformulation of Cartan-Khaneja-Glaser decomposition for SU(2^n) via involutive automorphisms and symmetric Lie algebra decompositions yields a stable recursive factorization with open-source Python code validated on SU(8) and SU(16).
citing papers explorer
-
pygridsynth: A fast numerical tool for ancilla-free Clifford+T synthesis
pygridsynth provides O(log(1/ε)) ancilla-free Clifford+T synthesis with a new partial-decomposition technique for n≥3 reducing T-count constants to (21/8·4^n - 9/2·2^n + 9)log₂(1/ε) + o(log(1/ε)) and a mixed-synthesis approach empirically lowering error to ε²/(2n).
-
Cartan-Khaneja-Glaser decomposition of $SU(2^n)$ via involutive automorphisms
Reformulation of Cartan-Khaneja-Glaser decomposition for SU(2^n) via involutive automorphisms and symmetric Lie algebra decompositions yields a stable recursive factorization with open-source Python code validated on SU(8) and SU(16).