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.
arXiv:2310.05958
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
support 1representative citing papers
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
Global optimization minimizes gate counts and compilation overhead in distributed quantum circuits, local optimization reduces non-local gates, and hybrid approaches balance both at the cost of much higher compilation time.
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.
-
Linear-Time T-Gate Optimization via Random Abstraction
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
-
Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings
Global optimization minimizes gate counts and compilation overhead in distributed quantum circuits, local optimization reduces non-local gates, and hybrid approaches balance both at the cost of much higher compilation time.