Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into consideration. Our algorithm re-synthesizes quantum circuits composed of Clifford group and T gates, …