Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2representative citing papers
Multiple-braiding sequences with multiplicities up to nine in SU(2)_k anyon models enable approximation of a universal gate set {H, T, CNOT} for k>2, k≠4, with numerical evidence from genetic algorithms.
citing papers explorer
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.
-
Universal Quantum Gate Set from Multiple-Braiding Sequences in $SU(2)_k$ ($k>2$, $k\neq 4$) Anyon Models
Multiple-braiding sequences with multiplicities up to nine in SU(2)_k anyon models enable approximation of a universal gate set {H, T, CNOT} for k>2, k≠4, with numerical evidence from genetic algorithms.