1. Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
2. An algorithm for the T-countAn algorithm for the T-count
3. Nabila Abdessaied , Mathias Soeken , and Rolf Drechsler . 2014. Quantum Circuit Optimization by Hadamard Gate Reduction . In Reversible Computation, Shigeru Yamashita and Shin-ichi Minato (Eds.). Springer International Publishing , Cham , 149–162. DOI: http://dx.doi.org/1007/978-3-319-08494-7_12 1007/978-3-319-08494-7_12 Nabila Abdessaied, Mathias Soeken, and Rolf Drechsler. 2014. Quantum Circuit Optimization by Hadamard Gate Reduction. In Reversible Computation, Shigeru Yamashita and Shin-ichi Minato (Eds.). Springer International Publishing, Cham, 149–162. DOI: http://dx.doi.org/1007/978-3-319-08494-7_12
4. T-Count Optimization and Reed–Muller Codes
5. Yunseong Nam , Neil J Ross , Yuan Su , Andrew M Childs , and Dmitri Maslov . 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 4, 1 ( 2018 ), 1–12. Yunseong Nam, Neil J Ross, Yuan Su, Andrew M Childs, and Dmitri Maslov. 2018. Automated optimization of large quantum circuits with continuous parameters. npj Quantum Information 4, 1 (2018), 1–12.