Presentation
Blaqsmith: Resolving Two-Qubit Gate Count Explosion in T-Count-Optimized Quantum Circuits
DescriptionState-of-the-art quantum circuit optimization (QCO) algorithms for T-count reduction often cause a significant increase in two-qubit gate count (2Q-count), a problem that current 2Q-count optimization techniques struggle to mitigate. We present Blaqsmith, a novel two-stage QCO flow that effectively counteracts the 2Q-gate surges in T-count-optimized Clifford+T circuits, achieving a 38.4% reduction in ancilla-free scenarios and 25.3% with ancillae. Furthermore, Blaqsmith scales to larger circuits by incorporating a perturbation-based heuristic that reduces runtime and memory usage. These advancements improve both the quality and scalability of Clifford+T circuit compilation.
Event Type
Networking
Work-in-Progress Poster
TimeSunday, June 226:00pm - 7:00pm PDT
LocationLevel 3 Lobby